./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:34:15,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:34:15,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 12:34:15,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:34:15,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:34:15,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:34:15,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:34:15,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:34:15,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:34:15,878 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:34:15,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:34:15,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:34:15,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:34:15,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:34:15,879 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:34:15,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:34:15,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:34:15,880 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:34:15,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 12:34:15,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:34:15,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:34:15,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:34:15,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:34:15,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:34:15,882 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:34:15,882 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:34:15,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:34:15,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:34:15,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:34:15,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:34:15,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:34:15,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:34:15,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:34:15,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:34:15,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:34:15,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:34:15,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 12:34:15,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 12:34:15,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:34:15,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:34:15,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:34:15,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:34:15,889 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 [2024-11-22 12:34:16,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:34:16,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:34:16,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:34:16,119 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:34:16,120 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:34:16,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-11-22 12:34:17,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:34:17,505 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:34:17,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-11-22 12:34:17,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f1427759/3f2b163323504519a2b32ad906fdfc60/FLAG296f26815 [2024-11-22 12:34:17,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f1427759/3f2b163323504519a2b32ad906fdfc60 [2024-11-22 12:34:17,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:34:17,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:34:17,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:34:17,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:34:17,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:34:17,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2d7ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17, skipping insertion in model container [2024-11-22 12:34:17,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:34:17,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-22 12:34:17,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:34:17,785 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:34:17,796 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-22 12:34:17,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:34:17,898 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:34:17,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17 WrapperNode [2024-11-22 12:34:17,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:34:17,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:34:17,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:34:17,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:34:17,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,953 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2024-11-22 12:34:17,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:34:17,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:34:17,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:34:17,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:34:17,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,983 INFO L175 MemorySlicer]: Split 143 memory accesses to 6 slices as follows [2, 15, 53, 5, 65, 3]. 45 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 2, 6, 1, 9, 1]. The 23 writes are split as follows [0, 3, 8, 1, 10, 1]. [2024-11-22 12:34:17,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:18,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:18,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:18,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:18,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:18,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:34:18,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:34:18,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:34:18,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:34:18,023 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:18,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:34:18,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:34:18,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 12:34:18,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 12:34:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:34:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 12:34:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 12:34:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 12:34:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 12:34:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 12:34:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-22 12:34:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-22 12:34:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-22 12:34:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-22 12:34:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-22 12:34:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-22 12:34:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-22 12:34:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-22 12:34:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-22 12:34:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-22 12:34:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-22 12:34:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-22 12:34:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-22 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-22 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-22 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-22 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-22 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-22 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-22 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-22 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:34:18,113 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:34:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 12:34:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 12:34:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 12:34:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 12:34:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 12:34:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-22 12:34:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:34:18,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:34:18,239 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:34:18,241 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:34:18,639 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-22 12:34:18,640 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:34:18,656 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:34:18,657 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:34:18,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:18 BoogieIcfgContainer [2024-11-22 12:34:18,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:34:18,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:34:18,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:34:18,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:34:18,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:34:17" (1/3) ... [2024-11-22 12:34:18,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7281e9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:34:18, skipping insertion in model container [2024-11-22 12:34:18,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (2/3) ... [2024-11-22 12:34:18,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7281e9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:34:18, skipping insertion in model container [2024-11-22 12:34:18,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:18" (3/3) ... [2024-11-22 12:34:18,665 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-48.i [2024-11-22 12:34:18,678 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:34:18,679 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:34:18,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:34:18,733 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@16610172, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:34:18,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:34:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 12:34:18,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:18,755 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:18,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:18,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:18,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1009184855, now seen corresponding path program 1 times [2024-11-22 12:34:18,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:34:18,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806498773] [2024-11-22 12:34:18,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:18,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:34:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-22 12:34:19,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:34:19,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806498773] [2024-11-22 12:34:19,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806498773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:34:19,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650554817] [2024-11-22 12:34:19,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:19,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:34:19,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:34:19,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:34:19,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 12:34:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:19,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:34:19,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-22 12:34:19,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:19,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650554817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:19,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:34:19,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 12:34:19,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074625609] [2024-11-22 12:34:19,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:19,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:34:19,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:34:19,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:34:19,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:34:19,465 INFO L87 Difference]: Start difference. First operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 12:34:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:19,490 INFO L93 Difference]: Finished difference Result 229 states and 361 transitions. [2024-11-22 12:34:19,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:34:19,493 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-22 12:34:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:19,498 INFO L225 Difference]: With dead ends: 229 [2024-11-22 12:34:19,498 INFO L226 Difference]: Without dead ends: 114 [2024-11-22 12:34:19,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:34:19,504 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:19,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-22 12:34:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-22 12:34:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-11-22 12:34:19,554 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 168 [2024-11-22 12:34:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:19,555 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-11-22 12:34:19,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 12:34:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-11-22 12:34:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 12:34:19,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:19,561 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:19,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 12:34:19,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 12:34:19,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:19,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:19,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1949683919, now seen corresponding path program 1 times [2024-11-22 12:34:19,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:34:19,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993033020] [2024-11-22 12:34:19,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:34:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:34:20,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:34:20,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993033020] [2024-11-22 12:34:20,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993033020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:20,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:20,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:34:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28420973] [2024-11-22 12:34:20,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:20,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:34:20,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:34:20,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:34:20,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:34:20,036 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 12:34:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:20,085 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2024-11-22 12:34:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:34:20,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-22 12:34:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:20,087 INFO L225 Difference]: With dead ends: 227 [2024-11-22 12:34:20,087 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 12:34:20,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:34:20,089 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:20,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 12:34:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-22 12:34:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-22 12:34:20,108 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 168 [2024-11-22 12:34:20,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:20,109 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-22 12:34:20,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 12:34:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-22 12:34:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 12:34:20,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:20,111 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:20,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 12:34:20,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:20,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash 503103053, now seen corresponding path program 1 times [2024-11-22 12:34:20,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:34:20,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72535065] [2024-11-22 12:34:20,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:20,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:34:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:34:20,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:34:20,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72535065] [2024-11-22 12:34:20,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72535065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:20,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:20,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:34:20,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33540324] [2024-11-22 12:34:20,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:20,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:34:20,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:34:20,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:34:20,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:34:20,305 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:34:20,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:20,329 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2024-11-22 12:34:20,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:34:20,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-22 12:34:20,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:20,332 INFO L225 Difference]: With dead ends: 232 [2024-11-22 12:34:20,332 INFO L226 Difference]: Without dead ends: 119 [2024-11-22 12:34:20,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:34:20,334 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:20,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 472 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-22 12:34:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-22 12:34:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2024-11-22 12:34:20,345 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 168 [2024-11-22 12:34:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:20,345 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2024-11-22 12:34:20,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:34:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2024-11-22 12:34:20,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 12:34:20,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:20,350 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:20,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 12:34:20,350 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:20,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:20,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1183161423, now seen corresponding path program 1 times [2024-11-22 12:34:20,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:34:20,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551672798] [2024-11-22 12:34:20,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:20,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:34:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:34:20,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:34:20,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551672798] [2024-11-22 12:34:20,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551672798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:20,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:20,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:34:20,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126367158] [2024-11-22 12:34:20,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:20,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:34:20,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:34:20,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:34:20,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:34:20,505 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:34:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:20,532 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2024-11-22 12:34:20,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:34:20,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-22 12:34:20,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:20,536 INFO L225 Difference]: With dead ends: 236 [2024-11-22 12:34:20,537 INFO L226 Difference]: Without dead ends: 121 [2024-11-22 12:34:20,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:34:20,539 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:20,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:20,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-22 12:34:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-22 12:34:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2024-11-22 12:34:20,549 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 168 [2024-11-22 12:34:20,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:20,550 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2024-11-22 12:34:20,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:34:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2024-11-22 12:34:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 12:34:20,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:20,552 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:20,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 12:34:20,552 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:20,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:20,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1336798511, now seen corresponding path program 1 times [2024-11-22 12:34:20,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:34:20,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601803805] [2024-11-22 12:34:20,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:20,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:34:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:34:20,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:34:20,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601803805] [2024-11-22 12:34:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601803805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:20,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:34:20,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894388540] [2024-11-22 12:34:20,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:20,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:34:20,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:34:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:34:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:34:20,711 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:34:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:20,729 INFO L93 Difference]: Finished difference Result 240 states and 341 transitions. [2024-11-22 12:34:20,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:34:20,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-22 12:34:20,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:20,730 INFO L225 Difference]: With dead ends: 240 [2024-11-22 12:34:20,730 INFO L226 Difference]: Without dead ends: 123 [2024-11-22 12:34:20,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:34:20,732 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:20,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-22 12:34:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-22 12:34:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2024-11-22 12:34:20,738 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 168 [2024-11-22 12:34:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:20,738 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2024-11-22 12:34:20,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:34:20,739 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2024-11-22 12:34:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 12:34:20,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:20,740 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:20,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 12:34:20,740 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:20,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:20,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1334951469, now seen corresponding path program 1 times [2024-11-22 12:34:20,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:34:20,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746141655] [2024-11-22 12:34:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:34:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:34:22,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:34:22,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746141655] [2024-11-22 12:34:22,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746141655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:22,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:22,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:34:22,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795372874] [2024-11-22 12:34:22,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:22,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:34:22,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:34:22,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:34:22,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:34:22,438 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 6 states, 3 states have (on average 22.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-22 12:34:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:22,550 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2024-11-22 12:34:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:34:22,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 3 states have (on average 22.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) Word has length 168 [2024-11-22 12:34:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:22,551 INFO L225 Difference]: With dead ends: 241 [2024-11-22 12:34:22,551 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 12:34:22,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:34:22,553 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:22,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 691 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:34:22,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 12:34:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-22 12:34:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.303030303030303) internal successors, (129), 99 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2024-11-22 12:34:22,559 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 168 [2024-11-22 12:34:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:22,559 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2024-11-22 12:34:22,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 3 states have (on average 22.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-22 12:34:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2024-11-22 12:34:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 12:34:22,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:22,561 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:22,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 12:34:22,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:22,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:22,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1271072085, now seen corresponding path program 1 times [2024-11-22 12:34:22,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:34:22,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516157121] [2024-11-22 12:34:22,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:22,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:34:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:34:22,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 12:34:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:34:22,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 12:34:22,803 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 12:34:22,803 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 12:34:22,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 12:34:22,807 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:22,892 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 12:34:22,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:34:22 BoogieIcfgContainer [2024-11-22 12:34:22,895 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 12:34:22,895 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 12:34:22,895 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 12:34:22,895 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 12:34:22,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:18" (3/4) ... [2024-11-22 12:34:22,898 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 12:34:22,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 12:34:22,900 INFO L158 Benchmark]: Toolchain (without parser) took 5359.17ms. Allocated memory was 172.0MB in the beginning and 287.3MB in the end (delta: 115.3MB). Free memory was 101.5MB in the beginning and 219.6MB in the end (delta: -118.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:34:22,900 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:34:22,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.37ms. Allocated memory is still 172.0MB. Free memory was 101.2MB in the beginning and 137.4MB in the end (delta: -36.2MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-22 12:34:22,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.23ms. Allocated memory is still 172.0MB. Free memory was 137.4MB in the beginning and 133.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:34:22,902 INFO L158 Benchmark]: Boogie Preprocessor took 68.06ms. Allocated memory is still 172.0MB. Free memory was 133.2MB in the beginning and 126.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 12:34:22,902 INFO L158 Benchmark]: RCFGBuilder took 635.56ms. Allocated memory is still 172.0MB. Free memory was 126.9MB in the beginning and 89.8MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-22 12:34:22,902 INFO L158 Benchmark]: TraceAbstraction took 4235.42ms. Allocated memory was 172.0MB in the beginning and 287.3MB in the end (delta: 115.3MB). Free memory was 89.2MB in the beginning and 219.6MB in the end (delta: -130.4MB). Peak memory consumption was 124.7MB. Max. memory is 16.1GB. [2024-11-22 12:34:22,902 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 287.3MB. Free memory is still 219.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:34:22,903 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.37ms. Allocated memory is still 172.0MB. Free memory was 101.2MB in the beginning and 137.4MB in the end (delta: -36.2MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.23ms. Allocated memory is still 172.0MB. Free memory was 137.4MB in the beginning and 133.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.06ms. Allocated memory is still 172.0MB. Free memory was 133.2MB in the beginning and 126.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 635.56ms. Allocated memory is still 172.0MB. Free memory was 126.9MB in the beginning and 89.8MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4235.42ms. Allocated memory was 172.0MB in the beginning and 287.3MB in the end (delta: 115.3MB). Free memory was 89.2MB in the beginning and 219.6MB in the end (delta: -130.4MB). Peak memory consumption was 124.7MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 287.3MB. Free memory is still 219.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 64 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 64 }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L37] unsigned char last_1_unsigned_char_Array_0_0__1_ = 5; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR unsigned_char_Array_0[0][1] [L104] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] float_Array_0[0][0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0][0] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F [L72] EXPR float_Array_0[0][0] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] float_Array_0[1][0] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1][0] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F [L74] EXPR float_Array_0[1][0] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] float_Array_0[0][1] = __VERIFIER_nondet_float() [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] float_Array_0[1][1] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[1][1] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L78] EXPR float_Array_0[1][1] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] float_Array_0[0][2] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0][2] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F [L80] EXPR float_Array_0[0][2] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L85] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 190) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 190) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] unsigned_char_Array_0[2][1] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[2][1] >= 191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[2][1] >= 191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] EXPR unsigned_char_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[2][1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[2][1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L97] EXPR unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[1][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[1][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[1][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[1][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] unsigned_char_Array_0[2][2] = __VERIFIER_nondet_uchar() [L100] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[2][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[2][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] CALL assume_abort_if_not(unsigned_char_Array_0[2][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] RET assume_abort_if_not(unsigned_char_Array_0[2][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L115] RET updateVariables() [L116] CALL step() [L41] EXPR float_Array_0[0][2] [L41] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L41] COND FALSE !(float_Array_0[0][2] <= float_Array_0[1][1]) [L48] EXPR float_Array_0[0][0] [L48] float_Array_0[1][2] = float_Array_0[0][0] [L50] EXPR unsigned_char_Array_0[0][2] [L50] unsigned_long_int_Array_0[0] = unsigned_char_Array_0[0][2] [L51] EXPR unsigned_char_Array_0[2][1] [L51] signed_long_int_Array_0[0] = unsigned_char_Array_0[2][1] [L52] unsigned_char_Array_0[2][0] = 4 [L53] EXPR signed_long_int_Array_0[0] [L53] signed long int stepLocal_0 = signed_long_int_Array_0[0]; [L54] EXPR unsigned_char_Array_0[2][1] [L54] EXPR unsigned_char_Array_0[0][0] [L54] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L54] COND FALSE !(((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > stepLocal_0) [L57] EXPR BOOL_unsigned_char_Array_0[1] [L57] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L59] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR float_Array_0[0][2] [L107] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0])) [L107] EXPR float_Array_0[1][2] [L107] EXPR float_Array_0[0][0] [L107] EXPR (float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107-L108] return ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 2750 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1781 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 183 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 969 mSDtfsCounter, 183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=5, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1344 NumberOfCodeBlocks, 1344 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1169 ConstructedInterpolants, 0 QuantifiedInterpolants, 1210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 572 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 5840/5880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 12:34:22,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:34:24,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:34:24,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 12:34:24,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:34:24,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:34:24,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:34:24,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:34:24,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:34:24,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:34:24,868 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:34:24,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:34:24,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:34:24,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:34:24,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:34:24,871 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:34:24,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:34:24,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:34:24,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:34:24,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:34:24,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:34:24,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:34:24,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:34:24,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:34:24,876 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 12:34:24,876 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 12:34:24,876 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:34:24,876 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 12:34:24,876 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:34:24,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:34:24,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:34:24,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:34:24,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:34:24,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:34:24,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:34:24,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:34:24,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:34:24,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:34:24,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:34:24,878 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 12:34:24,878 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 12:34:24,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:34:24,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:34:24,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:34:24,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:34:24,879 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 [2024-11-22 12:34:25,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:34:25,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:34:25,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:34:25,186 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:34:25,187 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:34:25,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-11-22 12:34:26,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:34:26,703 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:34:26,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-11-22 12:34:26,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2c1ab6fa/f8917bf895d94972835a032cd826fa4a/FLAGb5b45c5ed [2024-11-22 12:34:27,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2c1ab6fa/f8917bf895d94972835a032cd826fa4a [2024-11-22 12:34:27,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:34:27,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:34:27,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:34:27,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:34:27,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:34:27,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c3ccff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27, skipping insertion in model container [2024-11-22 12:34:27,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:34:27,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-22 12:34:27,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:34:27,346 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:34:27,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-22 12:34:27,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:34:27,451 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:34:27,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27 WrapperNode [2024-11-22 12:34:27,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:34:27,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:34:27,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:34:27,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:34:27,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,511 INFO L138 Inliner]: procedures = 33, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2024-11-22 12:34:27,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:34:27,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:34:27,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:34:27,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:34:27,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,552 INFO L175 MemorySlicer]: Split 143 memory accesses to 6 slices as follows [2, 15, 53, 5, 65, 3]. 45 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 2, 6, 1, 9, 1]. The 23 writes are split as follows [0, 3, 8, 1, 10, 1]. [2024-11-22 12:34:27,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:34:27,582 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:34:27,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:34:27,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:34:27,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:34:27,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:34:27,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 12:34:27,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 12:34:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:34:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 12:34:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 12:34:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 12:34:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-22 12:34:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-22 12:34:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-22 12:34:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 12:34:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 12:34:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 12:34:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 12:34:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-22 12:34:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-22 12:34:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 12:34:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 12:34:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-22 12:34:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-22 12:34:27,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-22 12:34:27,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-22 12:34:27,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-22 12:34:27,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-22 12:34:27,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-22 12:34:27,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-22 12:34:27,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-22 12:34:27,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-22 12:34:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 12:34:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 12:34:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 12:34:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-22 12:34:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-22 12:34:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-22 12:34:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-22 12:34:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-22 12:34:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-22 12:34:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-22 12:34:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-22 12:34:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-22 12:34:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-22 12:34:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-22 12:34:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-22 12:34:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-22 12:34:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-22 12:34:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-22 12:34:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:34:27,660 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:34:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:34:27,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:34:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 12:34:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 12:34:27,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-22 12:34:27,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-22 12:34:27,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-22 12:34:27,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-22 12:34:27,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 12:34:27,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 12:34:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 12:34:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-22 12:34:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-22 12:34:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-22 12:34:27,780 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:34:27,782 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:34:29,553 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-22 12:34:29,553 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:34:29,573 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:34:29,573 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:34:29,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:29 BoogieIcfgContainer [2024-11-22 12:34:29,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:34:29,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:34:29,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:34:29,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:34:29,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:34:27" (1/3) ... [2024-11-22 12:34:29,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204ba142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:34:29, skipping insertion in model container [2024-11-22 12:34:29,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (2/3) ... [2024-11-22 12:34:29,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204ba142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:34:29, skipping insertion in model container [2024-11-22 12:34:29,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:29" (3/3) ... [2024-11-22 12:34:29,582 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-48.i [2024-11-22 12:34:29,594 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:34:29,594 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:34:29,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:34:29,653 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3095af73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:34:29,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:34:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 12:34:29,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:29,670 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:29,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:29,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1009184855, now seen corresponding path program 1 times [2024-11-22 12:34:29,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:29,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038092081] [2024-11-22 12:34:29,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:29,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:29,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:29,686 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:29,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 12:34:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:30,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:34:30,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-11-22 12:34:30,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:30,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:30,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038092081] [2024-11-22 12:34:30,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038092081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:30,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:30,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 12:34:30,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410078839] [2024-11-22 12:34:30,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:30,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:34:30,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:30,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:34:30,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:34:30,132 INFO L87 Difference]: Start difference. First operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 12:34:30,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:30,157 INFO L93 Difference]: Finished difference Result 229 states and 361 transitions. [2024-11-22 12:34:30,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:34:30,159 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-22 12:34:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:30,164 INFO L225 Difference]: With dead ends: 229 [2024-11-22 12:34:30,165 INFO L226 Difference]: Without dead ends: 114 [2024-11-22 12:34:30,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:34:30,170 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:30,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-22 12:34:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-22 12:34:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-11-22 12:34:30,205 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 168 [2024-11-22 12:34:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:30,206 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-11-22 12:34:30,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 12:34:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-11-22 12:34:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 12:34:30,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:30,209 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:30,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 12:34:30,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:30,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:30,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1949683919, now seen corresponding path program 1 times [2024-11-22 12:34:30,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:30,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044678224] [2024-11-22 12:34:30,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:30,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:30,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:30,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:30,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 12:34:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:30,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:34:30,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-22 12:34:30,775 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:30,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:30,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044678224] [2024-11-22 12:34:30,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044678224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:30,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:30,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:34:30,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648610870] [2024-11-22 12:34:30,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:30,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:34:30,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:30,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:34:30,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:34:30,778 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 12:34:30,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:30,843 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2024-11-22 12:34:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:34:30,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-22 12:34:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:30,845 INFO L225 Difference]: With dead ends: 227 [2024-11-22 12:34:30,847 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 12:34:30,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:34:30,849 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:30,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 12:34:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-22 12:34:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-22 12:34:30,860 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 168 [2024-11-22 12:34:30,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:30,861 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-22 12:34:30,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 12:34:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-22 12:34:30,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 12:34:30,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:30,867 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:30,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:31,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:31,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:31,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash 503103053, now seen corresponding path program 1 times [2024-11-22 12:34:31,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:31,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73382866] [2024-11-22 12:34:31,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:31,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:31,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:31,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:31,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 12:34:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:31,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:34:31,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:31,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 48 [2024-11-22 12:34:31,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 12:34:31,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 62 [2024-11-22 12:34:31,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2024-11-22 12:34:32,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:32,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2024-11-22 12:34:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 98 proven. 57 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-11-22 12:34:32,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:34:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-22 12:34:32,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:32,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73382866] [2024-11-22 12:34:32,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73382866] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:34:32,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:34:32,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-22 12:34:32,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203951612] [2024-11-22 12:34:32,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:34:32,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 12:34:32,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:32,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 12:34:32,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:34:32,461 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-22 12:34:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:33,190 INFO L93 Difference]: Finished difference Result 358 states and 506 transitions. [2024-11-22 12:34:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 12:34:33,191 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) Word has length 168 [2024-11-22 12:34:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:33,193 INFO L225 Difference]: With dead ends: 358 [2024-11-22 12:34:33,193 INFO L226 Difference]: Without dead ends: 245 [2024-11-22 12:34:33,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2024-11-22 12:34:33,195 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 233 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:33,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1160 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:34:33,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-22 12:34:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 122. [2024-11-22 12:34:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2024-11-22 12:34:33,208 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 168 [2024-11-22 12:34:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:33,209 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2024-11-22 12:34:33,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-22 12:34:33,209 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2024-11-22 12:34:33,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 12:34:33,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:33,211 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:33,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 12:34:33,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:33,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:33,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1185840689, now seen corresponding path program 1 times [2024-11-22 12:34:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:33,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765468876] [2024-11-22 12:34:33,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:33,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:33,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:33,416 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:33,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 12:34:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:33,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:34:33,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:34:33,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:33,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:33,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765468876] [2024-11-22 12:34:33,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765468876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:33,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:33,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:34:33,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213732397] [2024-11-22 12:34:33,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:33,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:34:33,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:33,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:34:33,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:34:33,691 INFO L87 Difference]: Start difference. First operand 122 states and 171 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:34:33,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:33,726 INFO L93 Difference]: Finished difference Result 246 states and 346 transitions. [2024-11-22 12:34:33,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:34:33,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-22 12:34:33,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:33,729 INFO L225 Difference]: With dead ends: 246 [2024-11-22 12:34:33,729 INFO L226 Difference]: Without dead ends: 127 [2024-11-22 12:34:33,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:34:33,730 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:33,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 620 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-22 12:34:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-22 12:34:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 175 transitions. [2024-11-22 12:34:33,748 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 175 transitions. Word has length 168 [2024-11-22 12:34:33,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:33,749 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 175 transitions. [2024-11-22 12:34:33,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:34:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 175 transitions. [2024-11-22 12:34:33,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 12:34:33,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:33,751 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:33,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 12:34:33,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:33,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:33,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash -505782319, now seen corresponding path program 1 times [2024-11-22 12:34:33,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:33,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835546195] [2024-11-22 12:34:33,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:33,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:33,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:33,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:33,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 12:34:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:34,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 12:34:34,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:34:34,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:34,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:34,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835546195] [2024-11-22 12:34:34,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835546195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:34,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:34,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:34:34,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109714433] [2024-11-22 12:34:34,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:34,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:34:34,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:34,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:34:34,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:34:34,240 INFO L87 Difference]: Start difference. First operand 126 states and 175 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:34:34,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:34,287 INFO L93 Difference]: Finished difference Result 252 states and 351 transitions. [2024-11-22 12:34:34,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:34:34,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-22 12:34:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:34,291 INFO L225 Difference]: With dead ends: 252 [2024-11-22 12:34:34,291 INFO L226 Difference]: Without dead ends: 129 [2024-11-22 12:34:34,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:34:34,292 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:34,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 765 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:34,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-22 12:34:34,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-22 12:34:34,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:34,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 177 transitions. [2024-11-22 12:34:34,308 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 177 transitions. Word has length 168 [2024-11-22 12:34:34,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:34,309 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 177 transitions. [2024-11-22 12:34:34,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:34:34,309 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2024-11-22 12:34:34,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 12:34:34,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:34,311 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:34,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 12:34:34,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:34,512 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:34,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:34,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1269225043, now seen corresponding path program 1 times [2024-11-22 12:34:34,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:34,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892181784] [2024-11-22 12:34:34,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:34,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:34,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:34,516 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:34,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 12:34:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:34,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 12:34:34,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:34:34,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:34,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:34,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892181784] [2024-11-22 12:34:34,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892181784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:34,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:34,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:34:34,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587379429] [2024-11-22 12:34:34,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:34,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:34:34,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:34,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:34:34,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:34:34,803 INFO L87 Difference]: Start difference. First operand 128 states and 177 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:34:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:34,869 INFO L93 Difference]: Finished difference Result 256 states and 355 transitions. [2024-11-22 12:34:34,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:34:34,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-22 12:34:34,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:34,870 INFO L225 Difference]: With dead ends: 256 [2024-11-22 12:34:34,871 INFO L226 Difference]: Without dead ends: 131 [2024-11-22 12:34:34,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:34:34,871 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:34,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 911 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:34,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-22 12:34:34,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-22 12:34:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:34,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2024-11-22 12:34:34,880 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 168 [2024-11-22 12:34:34,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:34,880 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2024-11-22 12:34:34,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:34:34,880 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2024-11-22 12:34:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-22 12:34:34,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:34,882 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:34,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:35,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:35,083 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:35,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:35,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1271072085, now seen corresponding path program 1 times [2024-11-22 12:34:35,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:35,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635096364] [2024-11-22 12:34:35,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:35,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:35,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:35,086 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:35,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 12:34:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:35,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:34:35,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:35,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-22 12:34:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-11-22 12:34:35,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:35,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:35,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635096364] [2024-11-22 12:34:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635096364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:35,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:35,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:34:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288911034] [2024-11-22 12:34:35,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:35,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:34:35,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:35,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:34:35,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:34:35,457 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 12:34:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:36,894 INFO L93 Difference]: Finished difference Result 258 states and 356 transitions. [2024-11-22 12:34:36,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:34:36,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-22 12:34:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:36,901 INFO L225 Difference]: With dead ends: 258 [2024-11-22 12:34:36,901 INFO L226 Difference]: Without dead ends: 131 [2024-11-22 12:34:36,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:34:36,901 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 144 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:36,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 496 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-22 12:34:36,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-22 12:34:36,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-22 12:34:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 106 states have internal predecessors, (136), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 178 transitions. [2024-11-22 12:34:36,913 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 178 transitions. Word has length 168 [2024-11-22 12:34:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:36,913 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 178 transitions. [2024-11-22 12:34:36,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 12:34:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 178 transitions. [2024-11-22 12:34:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-22 12:34:36,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:36,915 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:36,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:37,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:37,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:37,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:37,116 INFO L85 PathProgramCache]: Analyzing trace with hash 639609807, now seen corresponding path program 1 times [2024-11-22 12:34:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:37,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008106161] [2024-11-22 12:34:37,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:37,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:37,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:37,118 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:37,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 12:34:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:37,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:34:37,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:37,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-22 12:34:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2024-11-22 12:34:37,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:37,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008106161] [2024-11-22 12:34:37,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008106161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:37,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:37,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:34:37,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445289254] [2024-11-22 12:34:37,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:37,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:34:37,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:37,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:34:37,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:34:37,492 INFO L87 Difference]: Start difference. First operand 130 states and 178 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 12:34:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:38,538 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2024-11-22 12:34:38,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:34:38,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 170 [2024-11-22 12:34:38,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:38,545 INFO L225 Difference]: With dead ends: 258 [2024-11-22 12:34:38,545 INFO L226 Difference]: Without dead ends: 131 [2024-11-22 12:34:38,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:34:38,546 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 135 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:38,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 494 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 12:34:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-22 12:34:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-22 12:34:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 106 states have internal predecessors, (135), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-22 12:34:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions. [2024-11-22 12:34:38,555 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 177 transitions. Word has length 170 [2024-11-22 12:34:38,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:38,555 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 177 transitions. [2024-11-22 12:34:38,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-22 12:34:38,555 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 177 transitions. [2024-11-22 12:34:38,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-22 12:34:38,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:38,557 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:38,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:38,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:38,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:38,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:38,758 INFO L85 PathProgramCache]: Analyzing trace with hash -854207723, now seen corresponding path program 1 times [2024-11-22 12:34:38,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:38,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065782058] [2024-11-22 12:34:38,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:38,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:38,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:38,760 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:38,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 12:34:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:39,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 12:34:39,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:39,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 12:34:39,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-22 12:34:39,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-22 12:34:39,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-22 12:34:39,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-22 12:34:39,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2024-11-22 12:34:40,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:40,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 80 [2024-11-22 12:34:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-22 12:34:40,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:34:40,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:40,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065782058] [2024-11-22 12:34:40,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065782058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:34:40,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1244407992] [2024-11-22 12:34:40,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:40,218 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:34:40,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:34:40,220 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:34:40,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-22 12:34:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:41,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 12:34:41,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:41,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 12:34:42,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-22 12:34:42,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-22 12:34:42,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-22 12:34:42,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-22 12:34:43,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-22 12:34:43,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:43,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 80 [2024-11-22 12:34:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-22 12:34:43,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:34:43,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1244407992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:34:43,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:34:43,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-22 12:34:43,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056194949] [2024-11-22 12:34:43,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:34:43,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 12:34:43,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:43,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 12:34:43,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-22 12:34:43,184 INFO L87 Difference]: Start difference. First operand 130 states and 177 transitions. Second operand has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-22 12:34:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:46,843 INFO L93 Difference]: Finished difference Result 379 states and 518 transitions. [2024-11-22 12:34:46,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 12:34:46,844 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 172 [2024-11-22 12:34:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:46,846 INFO L225 Difference]: With dead ends: 379 [2024-11-22 12:34:46,846 INFO L226 Difference]: Without dead ends: 252 [2024-11-22 12:34:46,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2024-11-22 12:34:46,847 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 549 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:46,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1164 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-22 12:34:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-22 12:34:46,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 208. [2024-11-22 12:34:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 164 states have (on average 1.274390243902439) internal successors, (209), 164 states have internal predecessors, (209), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:34:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 289 transitions. [2024-11-22 12:34:46,863 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 289 transitions. Word has length 172 [2024-11-22 12:34:46,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:46,863 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 289 transitions. [2024-11-22 12:34:46,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-22 12:34:46,863 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 289 transitions. [2024-11-22 12:34:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-22 12:34:46,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:46,865 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:46,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:47,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-22 12:34:47,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:47,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:47,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:47,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1733125341, now seen corresponding path program 1 times [2024-11-22 12:34:47,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:47,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775150874] [2024-11-22 12:34:47,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:47,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:47,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:47,267 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:47,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 12:34:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:47,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 12:34:47,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:47,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 43 [2024-11-22 12:34:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 8 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-22 12:34:47,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:34:47,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2024-11-22 12:34:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-22 12:34:47,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:47,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775150874] [2024-11-22 12:34:47,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775150874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:34:47,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:34:47,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-22 12:34:47,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836153617] [2024-11-22 12:34:47,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:34:47,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 12:34:47,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:47,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 12:34:47,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:34:47,803 INFO L87 Difference]: Start difference. First operand 208 states and 289 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-22 12:34:49,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:49,377 INFO L93 Difference]: Finished difference Result 428 states and 592 transitions. [2024-11-22 12:34:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 12:34:49,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) Word has length 174 [2024-11-22 12:34:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:49,383 INFO L225 Difference]: With dead ends: 428 [2024-11-22 12:34:49,383 INFO L226 Difference]: Without dead ends: 212 [2024-11-22 12:34:49,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-22 12:34:49,384 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 145 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:49,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 692 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-22 12:34:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-22 12:34:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2024-11-22 12:34:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 162 states have (on average 1.2654320987654322) internal successors, (205), 162 states have internal predecessors, (205), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:34:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 285 transitions. [2024-11-22 12:34:49,395 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 285 transitions. Word has length 174 [2024-11-22 12:34:49,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:49,396 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 285 transitions. [2024-11-22 12:34:49,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-22 12:34:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 285 transitions. [2024-11-22 12:34:49,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-22 12:34:49,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:49,397 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:49,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-22 12:34:49,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:49,598 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:49,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash 633954736, now seen corresponding path program 1 times [2024-11-22 12:34:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:49,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865202218] [2024-11-22 12:34:49,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:49,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:49,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:49,601 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:49,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-22 12:34:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:50,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 12:34:50,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:50,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 12:34:50,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-22 12:34:50,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-22 12:34:50,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-22 12:34:50,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-22 12:34:50,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2024-11-22 12:34:50,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:50,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 80 [2024-11-22 12:34:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-22 12:34:50,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:34:51,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:51,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865202218] [2024-11-22 12:34:51,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865202218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:34:51,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1835201430] [2024-11-22 12:34:51,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:51,016 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:34:51,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:34:51,017 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:34:51,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-22 12:34:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:52,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 12:34:52,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:52,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 12:34:53,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-22 12:34:53,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-22 12:34:53,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-22 12:34:53,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-22 12:34:53,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-22 12:34:53,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:53,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 80 [2024-11-22 12:34:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-22 12:34:53,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:34:53,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1835201430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:34:53,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:34:53,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-22 12:34:53,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792501142] [2024-11-22 12:34:53,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:34:53,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 12:34:53,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:53,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 12:34:53,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-22 12:34:53,983 INFO L87 Difference]: Start difference. First operand 206 states and 285 transitions. Second operand has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 16 states have internal predecessors, (135), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-22 12:34:57,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:57,887 INFO L93 Difference]: Finished difference Result 451 states and 619 transitions. [2024-11-22 12:34:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 12:34:57,888 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 16 states have internal predecessors, (135), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 174 [2024-11-22 12:34:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:57,889 INFO L225 Difference]: With dead ends: 451 [2024-11-22 12:34:57,889 INFO L226 Difference]: Without dead ends: 248 [2024-11-22 12:34:57,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-11-22 12:34:57,890 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 563 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:57,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1224 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-22 12:34:57,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-22 12:34:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 208. [2024-11-22 12:34:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 164 states have (on average 1.2682926829268293) internal successors, (208), 164 states have internal predecessors, (208), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:34:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 288 transitions. [2024-11-22 12:34:57,910 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 288 transitions. Word has length 174 [2024-11-22 12:34:57,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:57,911 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 288 transitions. [2024-11-22 12:34:57,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 16 states have internal predecessors, (135), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-22 12:34:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 288 transitions. [2024-11-22 12:34:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-22 12:34:57,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:57,912 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:57,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-22 12:34:58,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-22 12:34:58,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:58,313 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:58,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash 156912928, now seen corresponding path program 1 times [2024-11-22 12:34:58,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:58,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996596550] [2024-11-22 12:34:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:58,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:58,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:58,316 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:58,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-22 12:34:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:58,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:34:58,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:34:58,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:58,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:58,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996596550] [2024-11-22 12:34:58,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996596550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:58,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:58,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:34:58,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974733913] [2024-11-22 12:34:58,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:58,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:34:58,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:58,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:34:58,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:34:58,593 INFO L87 Difference]: Start difference. First operand 208 states and 288 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:34:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:58,628 INFO L93 Difference]: Finished difference Result 416 states and 577 transitions. [2024-11-22 12:34:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:34:58,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 174 [2024-11-22 12:34:58,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:58,632 INFO L225 Difference]: With dead ends: 416 [2024-11-22 12:34:58,632 INFO L226 Difference]: Without dead ends: 211 [2024-11-22 12:34:58,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:34:58,634 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:58,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 611 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:58,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-22 12:34:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-22 12:34:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 167 states have (on average 1.2634730538922156) internal successors, (211), 167 states have internal predecessors, (211), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:34:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 291 transitions. [2024-11-22 12:34:58,656 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 291 transitions. Word has length 174 [2024-11-22 12:34:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:58,657 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 291 transitions. [2024-11-22 12:34:58,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:34:58,657 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 291 transitions. [2024-11-22 12:34:58,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-22 12:34:58,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:58,658 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:58,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-22 12:34:58,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:58,858 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:58,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:58,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1388297179, now seen corresponding path program 1 times [2024-11-22 12:34:58,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:58,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033676286] [2024-11-22 12:34:58,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:58,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:58,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:58,862 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:58,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-22 12:34:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:59,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 12:34:59,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:59,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 12:34:59,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-22 12:34:59,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-22 12:34:59,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-22 12:34:59,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-22 12:34:59,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 63 [2024-11-22 12:34:59,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:59,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 78 [2024-11-22 12:35:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-22 12:35:00,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:35:00,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:35:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033676286] [2024-11-22 12:35:00,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033676286] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:35:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2104965698] [2024-11-22 12:35:00,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:00,094 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:35:00,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:35:00,095 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:35:00,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-22 12:35:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:01,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-22 12:35:01,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:35:01,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 12:35:02,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-22 12:35:02,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-22 12:35:02,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-22 12:35:02,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-22 12:35:03,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 57 [2024-11-22 12:35:03,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:35:03,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 78 [2024-11-22 12:35:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-22 12:35:03,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:35:03,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2104965698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:35:03,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:35:03,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-11-22 12:35:03,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046371808] [2024-11-22 12:35:03,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:35:03,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 12:35:03,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:35:03,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 12:35:03,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2024-11-22 12:35:03,220 INFO L87 Difference]: Start difference. First operand 211 states and 291 transitions. Second operand has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2024-11-22 12:35:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:35:07,377 INFO L93 Difference]: Finished difference Result 482 states and 651 transitions. [2024-11-22 12:35:07,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 12:35:07,378 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) Word has length 174 [2024-11-22 12:35:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:35:07,379 INFO L225 Difference]: With dead ends: 482 [2024-11-22 12:35:07,379 INFO L226 Difference]: Without dead ends: 274 [2024-11-22 12:35:07,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=1313, Unknown=0, NotChecked=0, Total=1640 [2024-11-22 12:35:07,380 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 553 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-22 12:35:07,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1388 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-22 12:35:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-22 12:35:07,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 215. [2024-11-22 12:35:07,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 170 states have (on average 1.2588235294117647) internal successors, (214), 170 states have internal predecessors, (214), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:35:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 294 transitions. [2024-11-22 12:35:07,394 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 294 transitions. Word has length 174 [2024-11-22 12:35:07,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:35:07,395 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 294 transitions. [2024-11-22 12:35:07,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2024-11-22 12:35:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 294 transitions. [2024-11-22 12:35:07,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-22 12:35:07,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:07,397 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:35:07,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-22 12:35:07,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-22 12:35:07,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-22 12:35:07,798 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:07,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:07,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1422318221, now seen corresponding path program 1 times [2024-11-22 12:35:07,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:35:07,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297582178] [2024-11-22 12:35:07,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:07,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:35:07,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:35:07,801 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:35:07,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-22 12:35:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:08,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 12:35:08,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:35:08,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-22 12:35:08,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2024-11-22 12:35:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:35:08,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:35:08,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:35:08,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297582178] [2024-11-22 12:35:08,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297582178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:35:08,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:35:08,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:35:08,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261450961] [2024-11-22 12:35:08,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:35:08,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:35:08,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:35:08,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:35:08,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:35:08,167 INFO L87 Difference]: Start difference. First operand 215 states and 294 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:35:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:35:08,393 INFO L93 Difference]: Finished difference Result 371 states and 511 transitions. [2024-11-22 12:35:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:35:08,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2024-11-22 12:35:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:35:08,396 INFO L225 Difference]: With dead ends: 371 [2024-11-22 12:35:08,396 INFO L226 Difference]: Without dead ends: 369 [2024-11-22 12:35:08,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:35:08,396 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 130 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:35:08,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1052 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:35:08,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-22 12:35:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 218. [2024-11-22 12:35:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 173 states have (on average 1.254335260115607) internal successors, (217), 173 states have internal predecessors, (217), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:35:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 297 transitions. [2024-11-22 12:35:08,423 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 297 transitions. Word has length 176 [2024-11-22 12:35:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:35:08,423 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 297 transitions. [2024-11-22 12:35:08,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:35:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 297 transitions. [2024-11-22 12:35:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-22 12:35:08,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:08,424 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:35:08,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-22 12:35:08,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:35:08,625 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:08,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:08,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1420471179, now seen corresponding path program 1 times [2024-11-22 12:35:08,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:35:08,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717259483] [2024-11-22 12:35:08,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:08,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:35:08,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:35:08,627 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:35:08,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-22 12:35:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:09,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 12:35:09,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:35:09,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 12:35:09,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-22 12:35:09,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-22 12:35:09,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:35:09,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-22 12:35:09,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:35:09,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2024-11-22 12:35:09,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-22 12:35:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-22 12:35:09,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:35:09,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:35:09,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717259483] [2024-11-22 12:35:09,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717259483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:35:09,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:35:09,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:35:09,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102917436] [2024-11-22 12:35:09,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:35:09,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:35:09,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:35:09,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:35:09,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:35:09,420 INFO L87 Difference]: Start difference. First operand 218 states and 297 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-22 12:35:09,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:35:09,820 INFO L93 Difference]: Finished difference Result 544 states and 743 transitions. [2024-11-22 12:35:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:35:09,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 176 [2024-11-22 12:35:09,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:35:09,822 INFO L225 Difference]: With dead ends: 544 [2024-11-22 12:35:09,822 INFO L226 Difference]: Without dead ends: 329 [2024-11-22 12:35:09,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:35:09,823 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 194 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:35:09,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 655 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:35:09,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-22 12:35:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2024-11-22 12:35:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 254 states have (on average 1.2519685039370079) internal successors, (318), 256 states have internal predecessors, (318), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 12:35:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 446 transitions. [2024-11-22 12:35:09,861 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 446 transitions. Word has length 176 [2024-11-22 12:35:09,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:35:09,862 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 446 transitions. [2024-11-22 12:35:09,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-22 12:35:09,862 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 446 transitions. [2024-11-22 12:35:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-22 12:35:09,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:09,863 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:35:09,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-22 12:35:10,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:35:10,063 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:10,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:10,064 INFO L85 PathProgramCache]: Analyzing trace with hash 354536183, now seen corresponding path program 1 times [2024-11-22 12:35:10,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:35:10,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114648381] [2024-11-22 12:35:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:10,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:35:10,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:35:10,065 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:35:10,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-22 12:35:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:10,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 12:35:10,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:35:10,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-22 12:35:10,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-22 12:35:10,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:35:10,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-22 12:35:10,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:35:10,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 40 [2024-11-22 12:35:10,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-22 12:35:10,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2024-11-22 12:35:10,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:35:10,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 32 [2024-11-22 12:35:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-22 12:35:10,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:35:10,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:35:10,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114648381] [2024-11-22 12:35:10,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114648381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:35:10,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:35:10,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:35:10,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547178583] [2024-11-22 12:35:10,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:35:10,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:35:10,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:35:10,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:35:10,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:35:10,833 INFO L87 Difference]: Start difference. First operand 327 states and 446 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-22 12:35:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:35:11,314 INFO L93 Difference]: Finished difference Result 568 states and 765 transitions. [2024-11-22 12:35:11,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:35:11,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 176 [2024-11-22 12:35:11,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:35:11,317 INFO L225 Difference]: With dead ends: 568 [2024-11-22 12:35:11,317 INFO L226 Difference]: Without dead ends: 345 [2024-11-22 12:35:11,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:35:11,318 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 318 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:35:11,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 666 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 12:35:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-22 12:35:11,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2024-11-22 12:35:11,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 264 states have (on average 1.2386363636363635) internal successors, (327), 266 states have internal predecessors, (327), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-22 12:35:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 463 transitions. [2024-11-22 12:35:11,358 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 463 transitions. Word has length 176 [2024-11-22 12:35:11,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:35:11,358 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 463 transitions. [2024-11-22 12:35:11,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-22 12:35:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 463 transitions. [2024-11-22 12:35:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-22 12:35:11,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:11,360 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:35:11,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-22 12:35:11,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:35:11,560 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:11,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1034594553, now seen corresponding path program 1 times [2024-11-22 12:35:11,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:35:11,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042479850] [2024-11-22 12:35:11,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:11,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:35:11,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:35:11,563 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:35:11,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-22 12:35:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:12,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:35:12,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:35:12,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 12:35:12,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-22 12:35:12,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:35:12,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 35 [2024-11-22 12:35:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 98 proven. 57 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-11-22 12:35:12,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:35:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:35:12,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:35:12,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042479850] [2024-11-22 12:35:12,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042479850] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:35:12,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:35:12,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-22 12:35:12,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507151441] [2024-11-22 12:35:12,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:35:12,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:35:12,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:35:12,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:35:12,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:35:12,402 INFO L87 Difference]: Start difference. First operand 343 states and 463 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:35:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:35:12,545 INFO L93 Difference]: Finished difference Result 633 states and 839 transitions. [2024-11-22 12:35:12,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:35:12,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2024-11-22 12:35:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:35:12,548 INFO L225 Difference]: With dead ends: 633 [2024-11-22 12:35:12,548 INFO L226 Difference]: Without dead ends: 402 [2024-11-22 12:35:12,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-22 12:35:12,549 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 38 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:35:12,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 778 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:35:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-22 12:35:12,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 376. [2024-11-22 12:35:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 297 states have (on average 1.2491582491582491) internal successors, (371), 299 states have internal predecessors, (371), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-22 12:35:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 507 transitions. [2024-11-22 12:35:12,591 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 507 transitions. Word has length 176 [2024-11-22 12:35:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:35:12,593 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 507 transitions. [2024-11-22 12:35:12,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:35:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 507 transitions. [2024-11-22 12:35:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-22 12:35:12,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:12,594 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:35:12,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-22 12:35:12,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:35:12,795 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:12,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:12,795 INFO L85 PathProgramCache]: Analyzing trace with hash 776429115, now seen corresponding path program 1 times [2024-11-22 12:35:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:35:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803380904] [2024-11-22 12:35:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:12,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:35:12,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:35:12,797 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:35:12,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-22 12:35:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:13,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 12:35:13,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:35:13,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2024-11-22 12:35:13,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 12:35:13,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:35:13,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 34 [2024-11-22 12:35:13,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-11-22 12:35:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:35:13,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:35:13,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:35:13,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803380904] [2024-11-22 12:35:13,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803380904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:35:13,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:35:13,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:35:13,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466370639] [2024-11-22 12:35:13,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:35:13,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:35:13,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:35:13,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:35:13,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:35:13,370 INFO L87 Difference]: Start difference. First operand 376 states and 507 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:35:17,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:35:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:35:19,135 INFO L93 Difference]: Finished difference Result 611 states and 812 transitions. [2024-11-22 12:35:19,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:35:19,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2024-11-22 12:35:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:35:19,139 INFO L225 Difference]: With dead ends: 611 [2024-11-22 12:35:19,139 INFO L226 Difference]: Without dead ends: 347 [2024-11-22 12:35:19,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:35:19,140 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 95 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:35:19,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 672 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-22 12:35:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-22 12:35:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-11-22 12:35:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 266 states have (on average 1.2218045112781954) internal successors, (325), 268 states have internal predecessors, (325), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-22 12:35:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 461 transitions. [2024-11-22 12:35:19,184 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 461 transitions. Word has length 176 [2024-11-22 12:35:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:35:19,184 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 461 transitions. [2024-11-22 12:35:19,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-22 12:35:19,185 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 461 transitions. [2024-11-22 12:35:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-22 12:35:19,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:19,186 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:35:19,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-22 12:35:19,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:35:19,386 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:19,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:19,386 INFO L85 PathProgramCache]: Analyzing trace with hash -392417034, now seen corresponding path program 1 times [2024-11-22 12:35:19,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:35:19,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40646538] [2024-11-22 12:35:19,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:19,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:35:19,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:35:19,388 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:35:19,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-22 12:35:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:19,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-22 12:35:19,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:35:20,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 12:35:23,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-22 12:35:23,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-22 12:35:24,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-22 12:35:25,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-22 12:35:32,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 63 [2024-11-22 12:35:33,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:35:33,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 78 [2024-11-22 12:35:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-22 12:35:34,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:35:36,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:35:36,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40646538] [2024-11-22 12:35:36,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40646538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:35:36,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1432653837] [2024-11-22 12:35:36,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:36,562 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:35:36,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:35:36,563 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:35:36,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-22 12:35:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:38,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-22 12:35:38,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:35:43,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 12:35:47,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32