./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.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 e1928f1269d04d8b5de337525ff72bdfae3247245ae6db35e73e266008ad3a3d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:21:17,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:21:17,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:21:17,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:21:17,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:21:17,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:21:17,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:21:17,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:21:17,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:21:17,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:21:17,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:21:17,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:21:17,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:21:17,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:21:17,934 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:21:17,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:21:17,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:21:17,935 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:21:17,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:21:17,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:21:17,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:21:17,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:21:17,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:21:17,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:21:17,937 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:21:17,938 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:21:17,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:21:17,938 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:21:17,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:21:17,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:21:17,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:21:17,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:21:17,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:21:17,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:21:17,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:21:17,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:21:17,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:21:17,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:21:17,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:21:17,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:21:17,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:21:17,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:21:17,942 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 -> e1928f1269d04d8b5de337525ff72bdfae3247245ae6db35e73e266008ad3a3d [2024-11-20 08:21:18,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:21:18,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:21:18,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:21:18,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:21:18,190 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:21:18,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i [2024-11-20 08:21:19,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:21:19,718 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:21:19,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i [2024-11-20 08:21:19,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c36a65dd7/5502997921b84231b1b047f04f3fcb6b/FLAG49e8a3879 [2024-11-20 08:21:19,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c36a65dd7/5502997921b84231b1b047f04f3fcb6b [2024-11-20 08:21:19,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:21:19,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:21:19,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:21:19,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:21:19,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:21:19,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:21:19" (1/1) ... [2024-11-20 08:21:19,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eae0ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:19, skipping insertion in model container [2024-11-20 08:21:19,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:21:19" (1/1) ... [2024-11-20 08:21:19,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:21:19,939 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-10.i[916,929] [2024-11-20 08:21:20,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:21:20,017 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:21:20,026 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-10.i[916,929] [2024-11-20 08:21:20,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:21:20,077 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:21:20,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:20 WrapperNode [2024-11-20 08:21:20,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:21:20,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:21:20,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:21:20,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:21:20,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:20" (1/1) ... [2024-11-20 08:21:20,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:20" (1/1) ... [2024-11-20 08:21:20,127 INFO L138 Inliner]: procedures = 29, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2024-11-20 08:21:20,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:21:20,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:21:20,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:21:20,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:21:20,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:20" (1/1) ... [2024-11-20 08:21:20,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:20" (1/1) ... [2024-11-20 08:21:20,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:20" (1/1) ... [2024-11-20 08:21:20,176 INFO L175 MemorySlicer]: Split 142 memory accesses to 8 slices as follows [2, 11, 36, 3, 48, 13, 11, 18]. 34 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 1, 5, 2, 2, 2]. The 22 writes are split as follows [0, 2, 6, 1, 6, 3, 2, 2]. [2024-11-20 08:21:20,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:20" (1/1) ... [2024-11-20 08:21:20,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:20" (1/1) ... [2024-11-20 08:21:20,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:20" (1/1) ... [2024-11-20 08:21:20,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:20" (1/1) ... [2024-11-20 08:21:20,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:20" (1/1) ... [2024-11-20 08:21:20,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:20" (1/1) ... [2024-11-20 08:21:20,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:21:20,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:21:20,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:21:20,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:21:20,219 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:20" (1/1) ... [2024-11-20 08:21:20,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:21:20,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:21:20,254 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-20 08:21:20,260 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-20 08:21:20,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:21:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-20 08:21:20,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-20 08:21:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-20 08:21:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-20 08:21:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-20 08:21:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-20 08:21:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-20 08:21:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-20 08:21:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 08:21:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 08:21:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 08:21:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 08:21:20,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 08:21:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-20 08:21:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-20 08:21:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-20 08:21:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-20 08:21:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-20 08:21:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-20 08:21:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-20 08:21:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-20 08:21:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-20 08:21:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-20 08:21:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-20 08:21:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 08:21:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 08:21:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 08:21:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 08:21:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 08:21:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-20 08:21:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-20 08:21:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-20 08:21:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-20 08:21:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-20 08:21:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-20 08:21:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-20 08:21:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-20 08:21:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-20 08:21:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-20 08:21:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-20 08:21:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:21:20,309 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:21:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:21:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 08:21:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 08:21:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 08:21:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 08:21:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-20 08:21:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-20 08:21:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-20 08:21:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:21:20,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:21:20,459 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:21:20,462 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:21:20,968 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-11-20 08:21:20,968 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:21:20,987 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:21:20,988 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:21:20,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:21:20 BoogieIcfgContainer [2024-11-20 08:21:20,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:21:20,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:21:20,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:21:20,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:21:20,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:21:19" (1/3) ... [2024-11-20 08:21:20,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f69da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:21:20, skipping insertion in model container [2024-11-20 08:21:20,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:20" (2/3) ... [2024-11-20 08:21:20,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f69da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:21:20, skipping insertion in model container [2024-11-20 08:21:20,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:21:20" (3/3) ... [2024-11-20 08:21:20,997 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-10.i [2024-11-20 08:21:21,011 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:21:21,012 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:21:21,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:21:21,087 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;@47bb7adf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:21:21,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:21:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 90 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:21:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 08:21:21,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:21,107 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:21,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:21,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:21,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1918999069, now seen corresponding path program 1 times [2024-11-20 08:21:21,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:21:21,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392836949] [2024-11-20 08:21:21,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:21,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:21:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:21:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:21:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:21:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:21:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:21:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:21:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:21:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:21:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:21:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:21:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:21:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:21:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:21:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:21:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:21:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:21:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:21:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:21:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:21:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:21:21,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:21:21,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392836949] [2024-11-20 08:21:21,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392836949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:21,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:21,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:21:21,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655637812] [2024-11-20 08:21:21,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:21,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:21:21,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:21:21,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:21:21,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:21:21,610 INFO L87 Difference]: Start difference. First operand has 111 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 90 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:21:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:21,646 INFO L93 Difference]: Finished difference Result 215 states and 335 transitions. [2024-11-20 08:21:21,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:21:21,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-11-20 08:21:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:21,656 INFO L225 Difference]: With dead ends: 215 [2024-11-20 08:21:21,657 INFO L226 Difference]: Without dead ends: 107 [2024-11-20 08:21:21,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-20 08:21:21,664 INFO L432 NwaCegarLoop]: 152 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, 152 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-20 08:21:21,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:21:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-20 08:21:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-20 08:21:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 86 states have internal predecessors, (114), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:21:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-11-20 08:21:21,718 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 152 [2024-11-20 08:21:21,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:21,719 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-11-20 08:21:21,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:21:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-11-20 08:21:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 08:21:21,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:21,722 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:21,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:21:21,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:21,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash -396215223, now seen corresponding path program 1 times [2024-11-20 08:21:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:21:21,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588863713] [2024-11-20 08:21:21,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:21,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:21:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:21:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:21:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:21:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:21:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:21:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:21:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:21:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:21:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:21:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:21:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:21:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:21:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:21:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:21:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:21:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:21:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:21:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:21:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:21:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:21:22,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:21:22,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588863713] [2024-11-20 08:21:22,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588863713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:22,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:22,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:21:22,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680815932] [2024-11-20 08:21:22,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:22,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:21:22,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:21:22,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:21:22,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:21:22,132 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:21:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:22,182 INFO L93 Difference]: Finished difference Result 213 states and 304 transitions. [2024-11-20 08:21:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:21:22,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-11-20 08:21:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:22,187 INFO L225 Difference]: With dead ends: 213 [2024-11-20 08:21:22,187 INFO L226 Difference]: Without dead ends: 109 [2024-11-20 08:21:22,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-20 08:21:22,191 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 439 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-20 08:21:22,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 439 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:21:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-20 08:21:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-20 08:21:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:21:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-11-20 08:21:22,201 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 152 [2024-11-20 08:21:22,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:22,202 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-11-20 08:21:22,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:21:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-11-20 08:21:22,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 08:21:22,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:22,206 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:22,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:21:22,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:22,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:22,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1795168825, now seen corresponding path program 1 times [2024-11-20 08:21:22,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:21:22,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773476380] [2024-11-20 08:21:22,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:22,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:21:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:21:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:21:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:21:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:21:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:21:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:21:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:21:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:21:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:21:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:21:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:21:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:21:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:21:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:21:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:21:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:21:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:21:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:21:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:21:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:21:22,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:21:22,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773476380] [2024-11-20 08:21:22,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773476380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:22,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:22,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:21:22,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355564594] [2024-11-20 08:21:22,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:22,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:21:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:21:22,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:21:22,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:21:22,530 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:22,568 INFO L93 Difference]: Finished difference Result 218 states and 309 transitions. [2024-11-20 08:21:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:21:22,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-20 08:21:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:22,572 INFO L225 Difference]: With dead ends: 218 [2024-11-20 08:21:22,572 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 08:21:22,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-20 08:21:22,576 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 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-20 08:21:22,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:21:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 08:21:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-20 08:21:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:21:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2024-11-20 08:21:22,588 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 152 [2024-11-20 08:21:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:22,591 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2024-11-20 08:21:22,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2024-11-20 08:21:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 08:21:22,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:22,594 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:22,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:21:22,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:22,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1115110455, now seen corresponding path program 1 times [2024-11-20 08:21:22,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:21:22,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063589297] [2024-11-20 08:21:22,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:22,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:21:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:21:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:21:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:21:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:21:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:21:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:21:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:21:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:21:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:21:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:21:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:21:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:21:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:21:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:21:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:21:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:21:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:21:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:21:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:21:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:21:22,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:21:22,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063589297] [2024-11-20 08:21:22,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063589297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:22,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:22,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:21:22,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997343811] [2024-11-20 08:21:22,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:22,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:21:22,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:21:22,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:21:22,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:21:22,820 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:22,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:22,849 INFO L93 Difference]: Finished difference Result 222 states and 313 transitions. [2024-11-20 08:21:22,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:21:22,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-20 08:21:22,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:22,851 INFO L225 Difference]: With dead ends: 222 [2024-11-20 08:21:22,851 INFO L226 Difference]: Without dead ends: 114 [2024-11-20 08:21:22,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-20 08:21:22,857 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 437 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-20 08:21:22,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 437 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:21:22,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-20 08:21:22,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-20 08:21:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:21:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 158 transitions. [2024-11-20 08:21:22,871 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 158 transitions. Word has length 152 [2024-11-20 08:21:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:22,872 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 158 transitions. [2024-11-20 08:21:22,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2024-11-20 08:21:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 08:21:22,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:22,876 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:22,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:21:22,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:22,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:22,877 INFO L85 PathProgramCache]: Analyzing trace with hash 659896907, now seen corresponding path program 1 times [2024-11-20 08:21:22,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:21:22,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432837618] [2024-11-20 08:21:22,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:22,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:21:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:21:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:21:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:21:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:21:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:21:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:21:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:21:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:21:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:21:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:21:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:21:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:21:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:21:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:21:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:21:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:21:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:21:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:21:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:21:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:21:23,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:21:23,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432837618] [2024-11-20 08:21:23,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432837618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:23,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:23,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:21:23,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908982457] [2024-11-20 08:21:23,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:23,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:21:23,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:21:23,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:21:23,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:21:23,091 INFO L87 Difference]: Start difference. First operand 113 states and 158 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:23,113 INFO L93 Difference]: Finished difference Result 226 states and 317 transitions. [2024-11-20 08:21:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:21:23,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-20 08:21:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:23,116 INFO L225 Difference]: With dead ends: 226 [2024-11-20 08:21:23,116 INFO L226 Difference]: Without dead ends: 116 [2024-11-20 08:21:23,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-20 08:21:23,117 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 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-20 08:21:23,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:21:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-20 08:21:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-20 08:21:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.297872340425532) internal successors, (122), 94 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:21:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2024-11-20 08:21:23,128 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 152 [2024-11-20 08:21:23,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:23,128 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2024-11-20 08:21:23,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:23,129 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2024-11-20 08:21:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 08:21:23,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:23,130 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:23,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:21:23,130 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:23,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:23,131 INFO L85 PathProgramCache]: Analyzing trace with hash 661743949, now seen corresponding path program 1 times [2024-11-20 08:21:23,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:21:23,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813243781] [2024-11-20 08:21:23,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:23,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:21:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:21:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:21:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:21:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:21:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:21:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:21:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:21:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:21:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:21:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:21:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:21:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:21:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:21:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:21:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:21:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:21:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:21:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:21:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:21:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:21:25,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:21:25,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813243781] [2024-11-20 08:21:25,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813243781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:25,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:25,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 08:21:25,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685485232] [2024-11-20 08:21:25,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:25,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 08:21:25,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:21:25,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 08:21:25,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:21:25,369 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-20 08:21:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:27,068 INFO L93 Difference]: Finished difference Result 536 states and 730 transitions. [2024-11-20 08:21:27,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 08:21:27,069 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 152 [2024-11-20 08:21:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:27,072 INFO L225 Difference]: With dead ends: 536 [2024-11-20 08:21:27,073 INFO L226 Difference]: Without dead ends: 424 [2024-11-20 08:21:27,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2024-11-20 08:21:27,076 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 800 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:21:27,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 1375 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 08:21:27,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-20 08:21:27,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 249. [2024-11-20 08:21:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 205 states have (on average 1.2926829268292683) internal successors, (265), 207 states have internal predecessors, (265), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 08:21:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 339 transitions. [2024-11-20 08:21:27,123 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 339 transitions. Word has length 152 [2024-11-20 08:21:27,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:27,126 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 339 transitions. [2024-11-20 08:21:27,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-20 08:21:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 339 transitions. [2024-11-20 08:21:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-20 08:21:27,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:27,128 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:27,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:21:27,129 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:27,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:27,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1015378120, now seen corresponding path program 1 times [2024-11-20 08:21:27,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:21:27,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854477213] [2024-11-20 08:21:27,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:21:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:21:27,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:21:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:21:27,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:21:27,414 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:21:27,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:21:27,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 08:21:27,422 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:21:27,525 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:21:27,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:21:27 BoogieIcfgContainer [2024-11-20 08:21:27,528 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:21:27,529 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:21:27,529 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:21:27,529 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:21:27,530 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:21:20" (3/4) ... [2024-11-20 08:21:27,532 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:21:27,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:21:27,534 INFO L158 Benchmark]: Toolchain (without parser) took 7791.61ms. Allocated memory was 180.4MB in the beginning and 283.1MB in the end (delta: 102.8MB). Free memory was 112.8MB in the beginning and 186.0MB in the end (delta: -73.2MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-11-20 08:21:27,535 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:21:27,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.69ms. Allocated memory is still 180.4MB. Free memory was 112.8MB in the beginning and 95.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 08:21:27,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.86ms. Allocated memory is still 180.4MB. Free memory was 95.6MB in the beginning and 91.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:21:27,536 INFO L158 Benchmark]: Boogie Preprocessor took 86.67ms. Allocated memory is still 180.4MB. Free memory was 91.9MB in the beginning and 86.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 08:21:27,537 INFO L158 Benchmark]: RCFGBuilder took 770.22ms. Allocated memory is still 180.4MB. Free memory was 86.6MB in the beginning and 125.4MB in the end (delta: -38.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-11-20 08:21:27,537 INFO L158 Benchmark]: TraceAbstraction took 6538.33ms. Allocated memory was 180.4MB in the beginning and 283.1MB in the end (delta: 102.8MB). Free memory was 124.5MB in the beginning and 187.0MB in the end (delta: -62.5MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2024-11-20 08:21:27,538 INFO L158 Benchmark]: Witness Printer took 5.03ms. Allocated memory is still 283.1MB. Free memory was 187.0MB in the beginning and 186.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:21:27,539 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.13ms. Allocated memory is still 117.4MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.69ms. Allocated memory is still 180.4MB. Free memory was 112.8MB in the beginning and 95.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.86ms. Allocated memory is still 180.4MB. Free memory was 95.6MB in the beginning and 91.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.67ms. Allocated memory is still 180.4MB. Free memory was 91.9MB in the beginning and 86.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 770.22ms. Allocated memory is still 180.4MB. Free memory was 86.6MB in the beginning and 125.4MB in the end (delta: -38.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6538.33ms. Allocated memory was 180.4MB in the beginning and 283.1MB in the end (delta: 102.8MB). Free memory was 124.5MB in the beginning and 187.0MB in the end (delta: -62.5MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * Witness Printer took 5.03ms. Allocated memory is still 283.1MB. Free memory was 187.0MB in the beginning and 186.0MB in the end (delta: 1.0MB). 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 someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someUnaryDOUBLEoperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L25-L27] double double_Array_0[2][2] = { {-0.8, 1000000.875}, {49.25, 9.15} }; [L28-L30] float float_Array_0[1] = { -0.5 }; [L28-L30] float float_Array_0[1] = { -0.5 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L31-L33] signed char signed_char_Array_0[5] = { 32, -10, 16, 2, 2 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { 1000000000, 32 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { 1000000000, 32 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { 1000000000, 32 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 5 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 5 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 8, 5 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 58996, 32 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 58996, 32 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 58996, 32 }; [L43] double last_1_double_Array_0_1__1_ = 9.15; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] CALL updateLastVariables() [L106] EXPR double_Array_0[1][1] [L106] last_1_double_Array_0_1__1_ = double_Array_0[1][1] [L116] RET updateLastVariables() [L117] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L77] double_Array_0[0][0] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[0][0] [L78] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F [L78] EXPR double_Array_0[0][0] [L78] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] EXPR (double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] EXPR (double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] CALL assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] RET assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] double_Array_0[1][0] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[1][0] [L80] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L80] EXPR double_Array_0[1][0] [L80] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L81] double_Array_0[0][1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0][1] [L82] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F [L82] EXPR double_Array_0[0][1] [L82] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] CALL assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] RET assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L90] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L93] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L93] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L93] RET assume_abort_if_not(signed_long_int_Array_0[0] >= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L95] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L96] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L96] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L96] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L98] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L99] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L99] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L99] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L100] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L100] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L100] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L101] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L102] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L102] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L102] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L103] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L103] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L103] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L117] RET updateVariables() [L118] CALL step() [L47] EXPR unsigned_long_int_Array_0[0] [L47] unsigned_long_int_Array_0[1] = unsigned_long_int_Array_0[0] [L48] EXPR double_Array_0[0][0] [L48] float_Array_0[0] = double_Array_0[0][0] [L49] EXPR signed_char_Array_0[0] [L49] signed_char_Array_0[4] = signed_char_Array_0[0] [L50] EXPR BOOL_unsigned_char_Array_0[1] [L50] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L51] EXPR signed_char_Array_0[4] [L51] signed char stepLocal_1 = signed_char_Array_0[4]; [L52] EXPR unsigned_short_int_Array_0[0] [L52] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L52] COND FALSE !((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= stepLocal_1) [L55] EXPR signed_char_Array_0[0] [L55] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L55] EXPR ((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]) [L55] EXPR signed_char_Array_0[0] [L55] EXPR ((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L55] signed_char_Array_0[1] = ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))) [L57] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L57] COND TRUE BOOL_unsigned_char_Array_0[0] [L58] EXPR signed_char_Array_0[0] [L58] EXPR signed_char_Array_0[3] [L58] signed_long_int_Array_0[1] = (signed_char_Array_0[0] - signed_char_Array_0[3]) [L62] EXPR signed_long_int_Array_0[1] [L62] signed long int stepLocal_0 = signed_long_int_Array_0[1]; [L63] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L63] COND TRUE stepLocal_0 < unsigned_long_int_Array_0[1] [L64] double_Array_0[1][1] = -0.5 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR unsigned_long_int_Array_0[1] [L109] EXPR unsigned_long_int_Array_0[0] [L109] EXPR (unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0])))) [L109] EXPR signed_long_int_Array_0[1] [L109] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))) [L109] EXPR double_Array_0[1][1] [L109] EXPR (signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1])))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1])))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR (((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109] EXPR ((((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L109-L110] return ((((((unsigned_long_int_Array_0[1] == ((unsigned long int) unsigned_long_int_Array_0[0])) && ((signed_long_int_Array_0[1] < unsigned_long_int_Array_0[1]) ? (double_Array_0[1][1] == ((double) -0.5)) : (((- last_1_double_Array_0_1__1_) == (double_Array_0[0][1] - double_Array_0[1][0])) ? (double_Array_0[1][1] == ((double) double_Array_0[0][0])) : (double_Array_0[1][1] == ((double) double_Array_0[0][0]))))) && (((- (unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[1])) >= signed_char_Array_0[4]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[0] - ((((signed_char_Array_0[2]) > (signed_char_Array_0[3])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[3])))))) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[3])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[3]))))))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[0] - signed_char_Array_0[3]))) : (signed_long_int_Array_0[1] == ((signed long int) (signed_char_Array_0[2] - ((signed_long_int_Array_0[0] - 4) + ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))))))) && (float_Array_0[0] == ((float) double_Array_0[0][0]))) && (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) ; [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1__1_=183/20, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 7, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 804 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 803 mSDsluCounter, 3278 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2354 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 850 IncrementalHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 924 mSDtfsCounter, 850 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=6, InterpolantAutomatonStates: 40, 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, 178 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1066 NumberOfCodeBlocks, 1066 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 906 ConstructedInterpolants, 0 QuantifiedInterpolants, 1863 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 4104/4104 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-20 08:21:27,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.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 e1928f1269d04d8b5de337525ff72bdfae3247245ae6db35e73e266008ad3a3d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:21:29,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:21:29,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:21:29,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:21:29,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:21:29,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:21:29,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:21:29,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:21:29,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:21:29,713 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:21:29,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:21:29,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:21:29,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:21:29,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:21:29,716 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:21:29,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:21:29,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:21:29,717 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:21:29,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:21:29,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:21:29,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:21:29,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:21:29,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:21:29,720 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:21:29,721 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:21:29,721 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:21:29,721 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:21:29,721 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:21:29,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:21:29,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:21:29,722 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:21:29,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:21:29,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:21:29,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:21:29,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:21:29,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:21:29,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:21:29,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:21:29,723 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:21:29,723 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:21:29,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:21:29,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:21:29,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:21:29,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:21:29,724 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 -> e1928f1269d04d8b5de337525ff72bdfae3247245ae6db35e73e266008ad3a3d [2024-11-20 08:21:29,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:21:30,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:21:30,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:21:30,019 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:21:30,020 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:21:30,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i [2024-11-20 08:21:31,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:21:31,637 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:21:31,638 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-10.i [2024-11-20 08:21:31,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62fa1cc37/8d5dee08eda042d383107f8d0f0aa4d4/FLAG1fcfa6d63 [2024-11-20 08:21:31,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62fa1cc37/8d5dee08eda042d383107f8d0f0aa4d4 [2024-11-20 08:21:31,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:21:31,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:21:31,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:21:31,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:21:31,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:21:31,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:21:31" (1/1) ... [2024-11-20 08:21:31,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10605544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:31, skipping insertion in model container [2024-11-20 08:21:31,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:21:31" (1/1) ... [2024-11-20 08:21:31,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:21:31,879 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-10.i[916,929] [2024-11-20 08:21:31,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:21:31,963 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:21:31,975 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-10.i[916,929] [2024-11-20 08:21:32,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:21:32,055 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:21:32,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:32 WrapperNode [2024-11-20 08:21:32,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:21:32,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:21:32,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:21:32,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:21:32,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:32" (1/1) ... [2024-11-20 08:21:32,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:32" (1/1) ... [2024-11-20 08:21:32,142 INFO L138 Inliner]: procedures = 39, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 497 [2024-11-20 08:21:32,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:21:32,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:21:32,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:21:32,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:21:32,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:32" (1/1) ... [2024-11-20 08:21:32,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:32" (1/1) ... [2024-11-20 08:21:32,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:32" (1/1) ... [2024-11-20 08:21:32,191 INFO L175 MemorySlicer]: Split 142 memory accesses to 8 slices as follows [2, 11, 36, 3, 48, 13, 11, 18]. 34 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 1, 5, 2, 2, 2]. The 22 writes are split as follows [0, 2, 6, 1, 6, 3, 2, 2]. [2024-11-20 08:21:32,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:32" (1/1) ... [2024-11-20 08:21:32,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:32" (1/1) ... [2024-11-20 08:21:32,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:32" (1/1) ... [2024-11-20 08:21:32,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:32" (1/1) ... [2024-11-20 08:21:32,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:32" (1/1) ... [2024-11-20 08:21:32,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:32" (1/1) ... [2024-11-20 08:21:32,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:21:32,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:21:32,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:21:32,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:21:32,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:32" (1/1) ... [2024-11-20 08:21:32,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:21:32,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:21:32,289 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-20 08:21:32,292 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-20 08:21:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:21:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-20 08:21:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-20 08:21:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-20 08:21:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-20 08:21:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-20 08:21:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-20 08:21:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-20 08:21:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-20 08:21:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-20 08:21:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-20 08:21:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-20 08:21:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-20 08:21:32,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-20 08:21:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-20 08:21:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-20 08:21:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-20 08:21:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 08:21:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 08:21:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 08:21:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-20 08:21:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-20 08:21:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-20 08:21:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-20 08:21:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-20 08:21:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-20 08:21:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-20 08:21:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-20 08:21:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-20 08:21:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-20 08:21:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-20 08:21:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-20 08:21:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-20 08:21:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:21:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 08:21:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 08:21:32,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 08:21:32,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-20 08:21:32,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-20 08:21:32,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-20 08:21:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-20 08:21:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-20 08:21:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-20 08:21:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-20 08:21:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-20 08:21:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-20 08:21:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-20 08:21:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-20 08:21:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-20 08:21:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-20 08:21:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-20 08:21:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-20 08:21:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-20 08:21:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-20 08:21:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-20 08:21:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-20 08:21:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-20 08:21:32,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-20 08:21:32,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-20 08:21:32,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-20 08:21:32,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-20 08:21:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-20 08:21:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-20 08:21:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-20 08:21:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-20 08:21:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 08:21:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 08:21:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 08:21:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-20 08:21:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-20 08:21:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-20 08:21:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-20 08:21:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-20 08:21:32,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-20 08:21:32,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-20 08:21:32,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-20 08:21:32,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-20 08:21:32,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-20 08:21:32,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-20 08:21:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-20 08:21:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-20 08:21:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-20 08:21:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-20 08:21:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-20 08:21:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-20 08:21:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-20 08:21:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-20 08:21:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-20 08:21:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-20 08:21:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-20 08:21:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-20 08:21:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-20 08:21:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-20 08:21:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-20 08:21:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-20 08:21:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-20 08:21:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-20 08:21:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:21:32,355 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:21:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:21:32,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:21:32,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 08:21:32,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 08:21:32,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-20 08:21:32,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-20 08:21:32,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-20 08:21:32,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-20 08:21:32,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-20 08:21:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-20 08:21:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-20 08:21:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-20 08:21:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-20 08:21:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-20 08:21:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-20 08:21:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-20 08:21:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-20 08:21:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-20 08:21:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 08:21:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 08:21:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 08:21:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-20 08:21:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-20 08:21:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-20 08:21:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-20 08:21:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-20 08:21:32,552 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:21:32,554 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:21:34,214 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-11-20 08:21:34,215 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:21:34,234 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:21:34,234 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:21:34,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:21:34 BoogieIcfgContainer [2024-11-20 08:21:34,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:21:34,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:21:34,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:21:34,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:21:34,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:21:31" (1/3) ... [2024-11-20 08:21:34,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b874b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:21:34, skipping insertion in model container [2024-11-20 08:21:34,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:32" (2/3) ... [2024-11-20 08:21:34,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b874b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:21:34, skipping insertion in model container [2024-11-20 08:21:34,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:21:34" (3/3) ... [2024-11-20 08:21:34,243 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-10.i [2024-11-20 08:21:34,258 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:21:34,258 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:21:34,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:21:34,332 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;@7031c317, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:21:34,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:21:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 90 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:21:34,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 08:21:34,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:34,353 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:34,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:34,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:34,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1918999069, now seen corresponding path program 1 times [2024-11-20 08:21:34,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:21:34,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556509287] [2024-11-20 08:21:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:34,378 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-20 08:21:34,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:21:34,381 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-20 08:21:34,383 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-20 08:21:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:34,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 08:21:34,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:21:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-20 08:21:34,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:21:34,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:21:34,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556509287] [2024-11-20 08:21:34,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556509287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:34,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:34,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:21:34,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801156977] [2024-11-20 08:21:34,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:34,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:21:34,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:21:34,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:21:34,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:21:34,884 INFO L87 Difference]: Start difference. First operand has 111 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 90 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:21:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:34,910 INFO L93 Difference]: Finished difference Result 215 states and 335 transitions. [2024-11-20 08:21:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:21:34,912 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-11-20 08:21:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:34,919 INFO L225 Difference]: With dead ends: 215 [2024-11-20 08:21:34,919 INFO L226 Difference]: Without dead ends: 107 [2024-11-20 08:21:34,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-20 08:21:34,926 INFO L432 NwaCegarLoop]: 152 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, 152 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-20 08:21:34,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:21:34,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-20 08:21:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-20 08:21:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 86 states have internal predecessors, (114), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:21:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-11-20 08:21:34,977 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 152 [2024-11-20 08:21:34,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:34,977 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-11-20 08:21:34,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:21:34,978 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-11-20 08:21:34,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 08:21:34,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:34,981 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:34,993 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-20 08:21:35,182 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-20 08:21:35,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:35,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:35,183 INFO L85 PathProgramCache]: Analyzing trace with hash -396215223, now seen corresponding path program 1 times [2024-11-20 08:21:35,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:21:35,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938363591] [2024-11-20 08:21:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:35,185 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-20 08:21:35,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:21:35,188 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-20 08:21:35,190 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-20 08:21:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:35,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:21:35,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:21:35,691 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-20 08:21:35,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:21:35,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:21:35,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938363591] [2024-11-20 08:21:35,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938363591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:35,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:35,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:21:35,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582006411] [2024-11-20 08:21:35,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:35,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:21:35,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:21:35,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:21:35,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:21:35,695 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:21:35,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:35,831 INFO L93 Difference]: Finished difference Result 213 states and 304 transitions. [2024-11-20 08:21:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:21:35,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-11-20 08:21:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:35,841 INFO L225 Difference]: With dead ends: 213 [2024-11-20 08:21:35,841 INFO L226 Difference]: Without dead ends: 109 [2024-11-20 08:21:35,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 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-20 08:21:35,845 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 439 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.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:21:35,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 439 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:21:35,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-20 08:21:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-20 08:21:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:21:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-11-20 08:21:35,867 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 152 [2024-11-20 08:21:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:35,870 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-11-20 08:21:35,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:21:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-11-20 08:21:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 08:21:35,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:35,875 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:35,888 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 (3)] Ended with exit code 0 [2024-11-20 08:21:36,075 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-20 08:21:36,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:36,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:36,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1795168825, now seen corresponding path program 1 times [2024-11-20 08:21:36,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:21:36,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37515012] [2024-11-20 08:21:36,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:36,078 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-20 08:21:36,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:21:36,080 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-20 08:21:36,081 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-20 08:21:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:36,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 08:21:36,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:21:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:21:36,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:21:36,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:21:36,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37515012] [2024-11-20 08:21:36,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37515012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:36,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:36,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:21:36,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133600567] [2024-11-20 08:21:36,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:36,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:21:36,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:21:36,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:21:36,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:21:36,541 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:36,771 INFO L93 Difference]: Finished difference Result 222 states and 315 transitions. [2024-11-20 08:21:36,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:21:36,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-20 08:21:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:36,774 INFO L225 Difference]: With dead ends: 222 [2024-11-20 08:21:36,774 INFO L226 Difference]: Without dead ends: 116 [2024-11-20 08:21:36,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 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-20 08:21:36,776 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:21:36,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 705 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:21:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-20 08:21:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-20 08:21:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.297872340425532) internal successors, (122), 94 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:21:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2024-11-20 08:21:36,790 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 152 [2024-11-20 08:21:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:36,791 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2024-11-20 08:21:36,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2024-11-20 08:21:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 08:21:36,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:36,799 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:36,813 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 (4)] Forceful destruction successful, exit code 0 [2024-11-20 08:21:36,999 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-20 08:21:37,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:37,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1115110455, now seen corresponding path program 1 times [2024-11-20 08:21:37,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:21:37,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081159214] [2024-11-20 08:21:37,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:37,002 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-20 08:21:37,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:21:37,005 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-20 08:21:37,006 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-20 08:21:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:37,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 08:21:37,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:21:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:21:37,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:21:37,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:21:37,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081159214] [2024-11-20 08:21:37,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081159214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:37,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:37,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:21:37,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944513] [2024-11-20 08:21:37,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:37,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:21:37,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:21:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:21:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:21:37,471 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:37,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:37,700 INFO L93 Difference]: Finished difference Result 230 states and 321 transitions. [2024-11-20 08:21:37,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:21:37,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-20 08:21:37,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:37,703 INFO L225 Difference]: With dead ends: 230 [2024-11-20 08:21:37,703 INFO L226 Difference]: Without dead ends: 118 [2024-11-20 08:21:37,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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-20 08:21:37,704 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:21:37,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 834 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:21:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-20 08:21:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-20 08:21:37,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 96 states have internal predecessors, (124), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:21:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 162 transitions. [2024-11-20 08:21:37,722 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 162 transitions. Word has length 152 [2024-11-20 08:21:37,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:37,723 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 162 transitions. [2024-11-20 08:21:37,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 162 transitions. [2024-11-20 08:21:37,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 08:21:37,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:37,725 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:37,741 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 (5)] Forceful destruction successful, exit code 0 [2024-11-20 08:21:37,925 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-20 08:21:37,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:37,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:37,926 INFO L85 PathProgramCache]: Analyzing trace with hash 659896907, now seen corresponding path program 1 times [2024-11-20 08:21:37,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:21:37,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360479198] [2024-11-20 08:21:37,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:37,927 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-20 08:21:37,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:21:37,930 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-20 08:21:37,931 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-20 08:21:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:38,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 08:21:38,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:21:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:21:38,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:21:38,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:21:38,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360479198] [2024-11-20 08:21:38,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360479198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:38,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:38,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:21:38,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660982337] [2024-11-20 08:21:38,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:38,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:21:38,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:21:38,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:21:38,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:21:38,334 INFO L87 Difference]: Start difference. First operand 117 states and 162 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:38,536 INFO L93 Difference]: Finished difference Result 234 states and 325 transitions. [2024-11-20 08:21:38,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:21:38,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-20 08:21:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:38,538 INFO L225 Difference]: With dead ends: 234 [2024-11-20 08:21:38,538 INFO L226 Difference]: Without dead ends: 120 [2024-11-20 08:21:38,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:21:38,539 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:21:38,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 965 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:21:38,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-20 08:21:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-20 08:21:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 98 states have internal predecessors, (126), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:21:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 164 transitions. [2024-11-20 08:21:38,552 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 164 transitions. Word has length 152 [2024-11-20 08:21:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:38,553 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 164 transitions. [2024-11-20 08:21:38,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 164 transitions. [2024-11-20 08:21:38,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 08:21:38,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:38,555 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:38,568 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-20 08:21:38,755 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-20 08:21:38,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:38,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:38,757 INFO L85 PathProgramCache]: Analyzing trace with hash 661743949, now seen corresponding path program 1 times [2024-11-20 08:21:38,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:21:38,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233598370] [2024-11-20 08:21:38,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:38,757 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-20 08:21:38,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:21:38,761 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-20 08:21:38,762 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-20 08:21:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:39,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 08:21:39,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:21:39,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:21:39,181 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 173 treesize of output 65 [2024-11-20 08:21:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-20 08:21:39,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:21:39,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:21:39,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233598370] [2024-11-20 08:21:39,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233598370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:39,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:39,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:21:39,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26157292] [2024-11-20 08:21:39,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:39,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:21:39,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:21:39,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:21:39,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:21:39,216 INFO L87 Difference]: Start difference. First operand 119 states and 164 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:21:40,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:40,208 INFO L93 Difference]: Finished difference Result 236 states and 326 transitions. [2024-11-20 08:21:40,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:21:40,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-11-20 08:21:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:40,214 INFO L225 Difference]: With dead ends: 236 [2024-11-20 08:21:40,215 INFO L226 Difference]: Without dead ends: 120 [2024-11-20 08:21:40,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:21:40,217 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 132 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 08:21:40,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 470 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 08:21:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-20 08:21:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-20 08:21:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 98 states have internal predecessors, (125), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:21:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 163 transitions. [2024-11-20 08:21:40,227 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 163 transitions. Word has length 152 [2024-11-20 08:21:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:40,227 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 163 transitions. [2024-11-20 08:21:40,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:21:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 163 transitions. [2024-11-20 08:21:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-20 08:21:40,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:40,231 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:40,242 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-20 08:21:40,431 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-20 08:21:40,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:40,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:40,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2048042823, now seen corresponding path program 1 times [2024-11-20 08:21:40,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:21:40,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60155631] [2024-11-20 08:21:40,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:40,433 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-20 08:21:40,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:21:40,434 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-20 08:21:40,436 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-20 08:21:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:40,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 08:21:40,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:21:40,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:21:40,864 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 173 treesize of output 65 [2024-11-20 08:21:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-11-20 08:21:40,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:21:40,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:21:40,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60155631] [2024-11-20 08:21:40,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60155631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:40,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:40,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:21:40,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140694361] [2024-11-20 08:21:40,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:40,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:21:40,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:21:40,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:21:40,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:21:40,894 INFO L87 Difference]: Start difference. First operand 119 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:21:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:42,165 INFO L93 Difference]: Finished difference Result 236 states and 324 transitions. [2024-11-20 08:21:42,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:21:42,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2024-11-20 08:21:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:42,172 INFO L225 Difference]: With dead ends: 236 [2024-11-20 08:21:42,172 INFO L226 Difference]: Without dead ends: 120 [2024-11-20 08:21:42,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:21:42,173 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 122 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:21:42,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 463 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 08:21:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-20 08:21:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-20 08:21:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 98 states have internal predecessors, (124), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:21:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 162 transitions. [2024-11-20 08:21:42,179 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 162 transitions. Word has length 154 [2024-11-20 08:21:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:42,180 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 162 transitions. [2024-11-20 08:21:42,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:21:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 162 transitions. [2024-11-20 08:21:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 08:21:42,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:42,181 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:42,198 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 (8)] Ended with exit code 0 [2024-11-20 08:21:42,385 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-20 08:21:42,386 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:42,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:42,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1145336205, now seen corresponding path program 1 times [2024-11-20 08:21:42,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:21:42,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275907711] [2024-11-20 08:21:42,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:42,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-20 08:21:42,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:21:42,390 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-20 08:21:42,391 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-20 08:21:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:42,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 08:21:42,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:21:42,856 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-20 08:21:42,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 17 treesize of output 17 [2024-11-20 08:21:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:21:42,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:21:42,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:21:42,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275907711] [2024-11-20 08:21:42,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275907711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:42,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:42,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:21:42,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888705557] [2024-11-20 08:21:42,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:42,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:21:42,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:21:42,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:21:42,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:21:42,911 INFO L87 Difference]: Start difference. First operand 119 states and 162 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:42,964 INFO L93 Difference]: Finished difference Result 282 states and 387 transitions. [2024-11-20 08:21:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:21:42,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-11-20 08:21:42,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:42,968 INFO L225 Difference]: With dead ends: 282 [2024-11-20 08:21:42,968 INFO L226 Difference]: Without dead ends: 166 [2024-11-20 08:21:42,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:21:42,969 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 119 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:21:42,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 502 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:21:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-20 08:21:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2024-11-20 08:21:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 130 states have (on average 1.2461538461538462) internal successors, (162), 131 states have internal predecessors, (162), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 08:21:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 226 transitions. [2024-11-20 08:21:42,983 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 226 transitions. Word has length 156 [2024-11-20 08:21:42,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:42,983 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 226 transitions. [2024-11-20 08:21:42,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:42,983 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 226 transitions. [2024-11-20 08:21:42,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 08:21:42,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:42,985 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:42,996 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 (9)] Ended with exit code 0 [2024-11-20 08:21:43,185 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-20 08:21:43,186 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:43,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:43,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1891068168, now seen corresponding path program 1 times [2024-11-20 08:21:43,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:21:43,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357602455] [2024-11-20 08:21:43,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:43,188 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-20 08:21:43,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:21:43,189 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-20 08:21:43,190 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-20 08:21:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:43,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 08:21:43,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:21:43,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 08:21:43,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2024-11-20 08:21:43,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:21:43,743 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 139 treesize of output 55 [2024-11-20 08:21:43,779 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:21:43,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:21:43,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:21:43,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357602455] [2024-11-20 08:21:43,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357602455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:43,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:43,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:21:43,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697122401] [2024-11-20 08:21:43,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:43,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:21:43,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:21:43,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:21:43,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:21:43,783 INFO L87 Difference]: Start difference. First operand 165 states and 226 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:21:46,462 INFO L93 Difference]: Finished difference Result 404 states and 548 transitions. [2024-11-20 08:21:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:21:46,469 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-11-20 08:21:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:21:46,473 INFO L225 Difference]: With dead ends: 404 [2024-11-20 08:21:46,473 INFO L226 Difference]: Without dead ends: 286 [2024-11-20 08:21:46,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:21:46,475 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 141 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:21:46,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1067 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-20 08:21:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-20 08:21:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 270. [2024-11-20 08:21:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.2383177570093458) internal successors, (265), 216 states have internal predecessors, (265), 51 states have call successors, (51), 4 states have call predecessors, (51), 4 states have return successors, (51), 49 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-20 08:21:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 367 transitions. [2024-11-20 08:21:46,504 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 367 transitions. Word has length 158 [2024-11-20 08:21:46,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:21:46,506 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 367 transitions. [2024-11-20 08:21:46,506 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 367 transitions. [2024-11-20 08:21:46,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 08:21:46,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:21:46,508 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:21:46,520 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 (10)] Forceful destruction successful, exit code 0 [2024-11-20 08:21:46,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-20 08:21:46,709 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:21:46,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:21:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash -183144136, now seen corresponding path program 1 times [2024-11-20 08:21:46,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:21:46,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750211943] [2024-11-20 08:21:46,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:21:46,710 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-20 08:21:46,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:21:46,711 INFO L229 MonitoredProcess]: Starting monitored process 11 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-20 08:21:46,712 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 (11)] Waiting until timeout for monitored process [2024-11-20 08:21:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:21:47,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 08:21:47,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:21:47,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:21:47,193 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 30 treesize of output 20 [2024-11-20 08:21:47,197 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 20 treesize of output 16 [2024-11-20 08:21:47,426 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 42 treesize of output 24 [2024-11-20 08:21:47,430 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 20 treesize of output 8 [2024-11-20 08:21:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:21:47,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:21:47,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:21:47,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750211943] [2024-11-20 08:21:47,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750211943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:21:47,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:21:47,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:21:47,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637657995] [2024-11-20 08:21:47,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:21:47,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:21:47,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:21:47,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:21:47,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:21:47,543 INFO L87 Difference]: Start difference. First operand 270 states and 367 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:21:56,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-20 08:21:58,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-20 08:22:06,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-20 08:22:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:22:08,614 INFO L93 Difference]: Finished difference Result 722 states and 971 transitions. [2024-11-20 08:22:08,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:22:08,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 159 [2024-11-20 08:22:08,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:22:08,618 INFO L225 Difference]: With dead ends: 722 [2024-11-20 08:22:08,618 INFO L226 Difference]: Without dead ends: 499 [2024-11-20 08:22:08,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:22:08,619 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 289 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:22:08,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 701 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 156 Invalid, 1 Unknown, 0 Unchecked, 21.0s Time] [2024-11-20 08:22:08,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-20 08:22:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 133. [2024-11-20 08:22:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.2522522522522523) internal successors, (139), 111 states have internal predecessors, (139), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:22:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions. [2024-11-20 08:22:08,642 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 159 [2024-11-20 08:22:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:22:08,643 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 177 transitions. [2024-11-20 08:22:08,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:22:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions. [2024-11-20 08:22:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 08:22:08,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:22:08,644 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:22:08,657 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 (11)] Ended with exit code 0 [2024-11-20 08:22:08,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-20 08:22:08,845 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:22:08,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:22:08,847 INFO L85 PathProgramCache]: Analyzing trace with hash -365843742, now seen corresponding path program 1 times [2024-11-20 08:22:08,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:22:08,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120612472] [2024-11-20 08:22:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:08,847 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-20 08:22:08,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:22:08,852 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-20 08:22:08,854 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-20 08:22:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:09,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 08:22:09,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:22:09,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:22:09,332 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 30 treesize of output 20 [2024-11-20 08:22:09,335 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 20 treesize of output 16 [2024-11-20 08:22:09,519 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 41 treesize of output 23 [2024-11-20 08:22:09,525 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 26 treesize of output 14 [2024-11-20 08:22:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:22:09,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:22:09,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:22:09,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120612472] [2024-11-20 08:22:09,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120612472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:22:09,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:22:09,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:22:09,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743962755] [2024-11-20 08:22:09,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:22:09,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:22:09,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:22:09,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:22:09,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:22:09,953 INFO L87 Difference]: Start difference. First operand 133 states and 177 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:22:29,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-20 08:22:29,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:22:29,716 INFO L93 Difference]: Finished difference Result 456 states and 608 transitions. [2024-11-20 08:22:29,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:22:29,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-11-20 08:22:29,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:22:29,720 INFO L225 Difference]: With dead ends: 456 [2024-11-20 08:22:29,720 INFO L226 Difference]: Without dead ends: 326 [2024-11-20 08:22:29,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:22:29,721 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 261 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:22:29,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 789 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 19.7s Time] [2024-11-20 08:22:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-20 08:22:29,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 211. [2024-11-20 08:22:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 177 states have (on average 1.2485875706214689) internal successors, (221), 178 states have internal predecessors, (221), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:22:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 281 transitions. [2024-11-20 08:22:29,737 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 281 transitions. Word has length 160 [2024-11-20 08:22:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:22:29,738 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 281 transitions. [2024-11-20 08:22:29,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:22:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 281 transitions. [2024-11-20 08:22:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-20 08:22:29,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:22:29,739 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:22:29,752 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 (12)] Forceful destruction successful, exit code 0 [2024-11-20 08:22:29,939 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-20 08:22:29,939 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:22:29,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:22:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash -819042542, now seen corresponding path program 1 times [2024-11-20 08:22:29,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:22:29,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130021950] [2024-11-20 08:22:29,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:29,941 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-20 08:22:29,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:22:29,943 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-20 08:22:29,944 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-20 08:22:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:30,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-20 08:22:30,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:22:30,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-20 08:22:31,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:22:31,109 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 144 treesize of output 75 [2024-11-20 08:22:34,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:22:34,246 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 54 treesize of output 48 [2024-11-20 08:22:44,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:22:44,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 92 [2024-11-20 08:22:44,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:22:44,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 306 treesize of output 110 [2024-11-20 08:22:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 124 proven. 136 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-20 08:22:44,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:22:44,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:22:44,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130021950] [2024-11-20 08:22:44,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130021950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:22:44,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1145374089] [2024-11-20 08:22:44,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:44,943 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 08:22:44,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 08:22:44,945 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-20 08:22:44,946 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-20 08:22:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:47,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-20 08:22:47,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:22:47,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17