./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.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 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:41:03,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:41:03,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:41:03,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:41:03,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:41:03,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:41:03,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:41:03,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:41:03,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:41:03,269 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:41:03,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:41:03,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:41:03,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:41:03,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:41:03,272 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:41:03,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:41:03,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:41:03,273 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:41:03,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:41:03,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:41:03,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:41:03,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:41:03,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:41:03,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:41:03,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:41:03,277 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:41:03,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:41:03,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:41:03,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:41:03,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:41:03,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:41:03,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:41:03,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:41:03,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:41:03,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:41:03,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:41:03,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:41:03,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:41:03,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:41:03,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:41:03,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:41:03,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:41:03,283 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 -> 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f [2024-11-19 00:41:03,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:41:03,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:41:03,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:41:03,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:41:03,554 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:41:03,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i [2024-11-19 00:41:05,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:41:05,208 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:41:05,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i [2024-11-19 00:41:05,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a39b78ee9/003b02c3e5824b7db5457b69c9432998/FLAGf0bff60fe [2024-11-19 00:41:05,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a39b78ee9/003b02c3e5824b7db5457b69c9432998 [2024-11-19 00:41:05,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:41:05,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:41:05,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:41:05,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:41:05,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:41:05,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:41:05" (1/1) ... [2024-11-19 00:41:05,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f921c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:05, skipping insertion in model container [2024-11-19 00:41:05,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:41:05" (1/1) ... [2024-11-19 00:41:05,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:41:05,822 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-92.i[916,929] [2024-11-19 00:41:05,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:41:05,921 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:41:05,936 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-92.i[916,929] [2024-11-19 00:41:05,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:41:06,016 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:41:06,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:06 WrapperNode [2024-11-19 00:41:06,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:41:06,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:41:06,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:41:06,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:41:06,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:06" (1/1) ... [2024-11-19 00:41:06,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:06" (1/1) ... [2024-11-19 00:41:06,081 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2024-11-19 00:41:06,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:41:06,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:41:06,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:41:06,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:41:06,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:06" (1/1) ... [2024-11-19 00:41:06,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:06" (1/1) ... [2024-11-19 00:41:06,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:06" (1/1) ... [2024-11-19 00:41:06,130 INFO L175 MemorySlicer]: Split 123 memory accesses to 7 slices as follows [2, 21, 23, 3, 61, 3, 10]. 50 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 3, 3, 1, 6, 1, 2]. The 18 writes are split as follows [0, 4, 4, 1, 6, 1, 2]. [2024-11-19 00:41:06,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:06" (1/1) ... [2024-11-19 00:41:06,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:06" (1/1) ... [2024-11-19 00:41:06,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:06" (1/1) ... [2024-11-19 00:41:06,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:06" (1/1) ... [2024-11-19 00:41:06,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:06" (1/1) ... [2024-11-19 00:41:06,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:06" (1/1) ... [2024-11-19 00:41:06,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:41:06,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:41:06,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:41:06,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:41:06,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:06" (1/1) ... [2024-11-19 00:41:06,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:41:06,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:41:06,222 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-19 00:41:06,226 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-19 00:41:06,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:41:06,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:41:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:41:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:41:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:41:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:41:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:41:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-19 00:41:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:41:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:41:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:41:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:41:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:41:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:41:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 00:41:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:41:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:41:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:41:06,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:41:06,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:41:06,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:41:06,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-19 00:41:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:41:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:41:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:41:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:41:06,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:41:06,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:41:06,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 00:41:06,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:41:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:41:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:41:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:41:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:41:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:41:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-19 00:41:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:41:06,286 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:41:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:41:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:41:06,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:41:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:41:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:41:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:41:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 00:41:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:41:06,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:41:06,479 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:41:06,482 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:41:07,052 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-19 00:41:07,053 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:41:07,070 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:41:07,071 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:41:07,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:41:07 BoogieIcfgContainer [2024-11-19 00:41:07,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:41:07,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:41:07,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:41:07,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:41:07,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:41:05" (1/3) ... [2024-11-19 00:41:07,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5677344c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:41:07, skipping insertion in model container [2024-11-19 00:41:07,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:06" (2/3) ... [2024-11-19 00:41:07,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5677344c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:41:07, skipping insertion in model container [2024-11-19 00:41:07,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:41:07" (3/3) ... [2024-11-19 00:41:07,082 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-92.i [2024-11-19 00:41:07,099 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:41:07,100 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:41:07,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:41:07,165 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;@291cfdfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:41:07,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:41:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 92 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-19 00:41:07,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 00:41:07,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:07,185 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] [2024-11-19 00:41:07,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:07,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash 982318703, now seen corresponding path program 1 times [2024-11-19 00:41:07,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:41:07,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090767304] [2024-11-19 00:41:07,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:07,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:41:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-19 00:41:07,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:41:07,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090767304] [2024-11-19 00:41:07,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090767304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:07,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878031933] [2024-11-19 00:41:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:07,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:41:07,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:41:07,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:41:07,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:41:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:07,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:41:07,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-19 00:41:07,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:07,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878031933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:07,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:41:07,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:41:07,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005763790] [2024-11-19 00:41:07,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:07,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:41:07,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:41:07,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:41:07,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:41:07,998 INFO L87 Difference]: Start difference. First operand has 113 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 92 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) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 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-19 00:41:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:08,032 INFO L93 Difference]: Finished difference Result 219 states and 339 transitions. [2024-11-19 00:41:08,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:41:08,034 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 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 153 [2024-11-19 00:41:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:08,041 INFO L225 Difference]: With dead ends: 219 [2024-11-19 00:41:08,041 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 00:41:08,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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-19 00:41:08,047 INFO L432 NwaCegarLoop]: 156 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, 156 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-19 00:41:08,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:41:08,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 00:41:08,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-19 00:41:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 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-19 00:41:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2024-11-19 00:41:08,106 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2024-11-19 00:41:08,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:08,108 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2024-11-19 00:41:08,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 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-19 00:41:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2024-11-19 00:41:08,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 00:41:08,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:08,113 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] [2024-11-19 00:41:08,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:41:08,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:41:08,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:08,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:08,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1326694963, now seen corresponding path program 1 times [2024-11-19 00:41:08,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:41:08,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387035455] [2024-11-19 00:41:08,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:08,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:41:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:08,702 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-19 00:41:08,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:41:08,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387035455] [2024-11-19 00:41:08,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387035455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:08,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:08,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:41:08,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707881857] [2024-11-19 00:41:08,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:08,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:41:08,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:41:08,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:41:08,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:41:08,706 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-19 00:41:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:08,759 INFO L93 Difference]: Finished difference Result 218 states and 313 transitions. [2024-11-19 00:41:08,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:41:08,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 153 [2024-11-19 00:41:08,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:08,765 INFO L225 Difference]: With dead ends: 218 [2024-11-19 00:41:08,766 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 00:41:08,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:41:08,771 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:08,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 450 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:41:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 00:41:08,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-19 00:41:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 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-19 00:41:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2024-11-19 00:41:08,799 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 153 [2024-11-19 00:41:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:08,801 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2024-11-19 00:41:08,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-19 00:41:08,801 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2024-11-19 00:41:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 00:41:08,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:08,804 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] [2024-11-19 00:41:08,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:41:08,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:08,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:08,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1324847921, now seen corresponding path program 1 times [2024-11-19 00:41:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:41:08,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841396852] [2024-11-19 00:41:08,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:08,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:41:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-19 00:41:09,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:41:09,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841396852] [2024-11-19 00:41:09,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841396852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:09,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200693682] [2024-11-19 00:41:09,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:09,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:41:09,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:41:09,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:41:09,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:41:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:09,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:41:09,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:10,101 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 81 treesize of output 67 [2024-11-19 00:41:10,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 93 [2024-11-19 00:41:10,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-19 00:41:10,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:10,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 29 [2024-11-19 00:41:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-19 00:41:10,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-19 00:41:11,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200693682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:41:11,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:41:11,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2024-11-19 00:41:11,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305015852] [2024-11-19 00:41:11,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:41:11,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:41:11,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:41:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:41:11,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:41:11,841 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 12 states, 9 states have (on average 8.555555555555555) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-19 00:41:12,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:12,293 INFO L93 Difference]: Finished difference Result 231 states and 323 transitions. [2024-11-19 00:41:12,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:41:12,294 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 8.555555555555555) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) Word has length 153 [2024-11-19 00:41:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:12,296 INFO L225 Difference]: With dead ends: 231 [2024-11-19 00:41:12,296 INFO L226 Difference]: Without dead ends: 123 [2024-11-19 00:41:12,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 302 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:41:12,298 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 215 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:12,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 467 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:41:12,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-19 00:41:12,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2024-11-19 00:41:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 96 states have internal predecessors, (125), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 00:41:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 163 transitions. [2024-11-19 00:41:12,314 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 163 transitions. Word has length 153 [2024-11-19 00:41:12,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:12,315 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 163 transitions. [2024-11-19 00:41:12,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 8.555555555555555) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-19 00:41:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 163 transitions. [2024-11-19 00:41:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 00:41:12,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:12,317 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] [2024-11-19 00:41:12,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:41:12,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-19 00:41:12,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:12,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:12,522 INFO L85 PathProgramCache]: Analyzing trace with hash -902146095, now seen corresponding path program 1 times [2024-11-19 00:41:12,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:41:12,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126750474] [2024-11-19 00:41:12,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:12,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:41:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:14,926 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-19 00:41:14,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:41:14,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126750474] [2024-11-19 00:41:14,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126750474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:14,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:14,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:41:14,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141734727] [2024-11-19 00:41:14,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:14,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:41:14,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:41:14,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:41:14,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:41:14,932 INFO L87 Difference]: Start difference. First operand 119 states and 163 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 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-19 00:41:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:15,714 INFO L93 Difference]: Finished difference Result 325 states and 450 transitions. [2024-11-19 00:41:15,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:41:15,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 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 153 [2024-11-19 00:41:15,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:15,718 INFO L225 Difference]: With dead ends: 325 [2024-11-19 00:41:15,718 INFO L226 Difference]: Without dead ends: 209 [2024-11-19 00:41:15,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:41:15,724 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 113 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:15,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1437 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:41:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-19 00:41:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-19 00:41:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 172 states have (on average 1.3313953488372092) internal successors, (229), 173 states have internal predecessors, (229), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 00:41:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2024-11-19 00:41:15,757 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 153 [2024-11-19 00:41:15,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:15,758 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2024-11-19 00:41:15,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 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-19 00:41:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2024-11-19 00:41:15,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 00:41:15,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:15,760 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] [2024-11-19 00:41:15,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:41:15,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:15,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:15,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2112957523, now seen corresponding path program 1 times [2024-11-19 00:41:15,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:41:15,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890877115] [2024-11-19 00:41:15,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:15,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:41:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:16,801 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-19 00:41:16,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:41:16,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890877115] [2024-11-19 00:41:16,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890877115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:16,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:16,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:41:16,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359468214] [2024-11-19 00:41:16,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:16,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:41:16,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:41:16,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:41:16,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:41:16,803 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-19 00:41:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:17,028 INFO L93 Difference]: Finished difference Result 413 states and 572 transitions. [2024-11-19 00:41:17,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:41:17,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 153 [2024-11-19 00:41:17,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:17,032 INFO L225 Difference]: With dead ends: 413 [2024-11-19 00:41:17,032 INFO L226 Difference]: Without dead ends: 210 [2024-11-19 00:41:17,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:41:17,034 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 97 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:17,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 748 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:41:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-19 00:41:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2024-11-19 00:41:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 173 states have (on average 1.3179190751445087) internal successors, (228), 174 states have internal predecessors, (228), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 00:41:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 286 transitions. [2024-11-19 00:41:17,058 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 286 transitions. Word has length 153 [2024-11-19 00:41:17,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:17,059 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 286 transitions. [2024-11-19 00:41:17,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-19 00:41:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 286 transitions. [2024-11-19 00:41:17,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 00:41:17,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:17,063 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] [2024-11-19 00:41:17,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:41:17,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:17,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:17,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1021081939, now seen corresponding path program 1 times [2024-11-19 00:41:17,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:41:17,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824511534] [2024-11-19 00:41:17,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:17,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:41:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:18,101 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-19 00:41:18,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:41:18,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824511534] [2024-11-19 00:41:18,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824511534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:18,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:18,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:41:18,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769829272] [2024-11-19 00:41:18,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:18,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:41:18,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:41:18,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:41:18,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:41:18,106 INFO L87 Difference]: Start difference. First operand 208 states and 286 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-19 00:41:18,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:18,319 INFO L93 Difference]: Finished difference Result 419 states and 573 transitions. [2024-11-19 00:41:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:41:18,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 153 [2024-11-19 00:41:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:18,325 INFO L225 Difference]: With dead ends: 419 [2024-11-19 00:41:18,325 INFO L226 Difference]: Without dead ends: 214 [2024-11-19 00:41:18,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:41:18,326 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 100 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:18,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 633 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:41:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-19 00:41:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2024-11-19 00:41:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 176 states have (on average 1.3068181818181819) internal successors, (230), 177 states have internal predecessors, (230), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 00:41:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 288 transitions. [2024-11-19 00:41:18,355 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 288 transitions. Word has length 153 [2024-11-19 00:41:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:18,355 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 288 transitions. [2024-11-19 00:41:18,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-19 00:41:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 288 transitions. [2024-11-19 00:41:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 00:41:18,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:18,357 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] [2024-11-19 00:41:18,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:41:18,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:18,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash -258781739, now seen corresponding path program 1 times [2024-11-19 00:41:18,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:41:18,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225097492] [2024-11-19 00:41:18,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:18,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:41:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:20,316 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-19 00:41:20,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:41:20,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225097492] [2024-11-19 00:41:20,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225097492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:20,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:20,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:41:20,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940437556] [2024-11-19 00:41:20,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:20,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:41:20,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:41:20,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:41:20,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:41:20,319 INFO L87 Difference]: Start difference. First operand 212 states and 288 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-19 00:41:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:20,836 INFO L93 Difference]: Finished difference Result 451 states and 613 transitions. [2024-11-19 00:41:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:41:20,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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 153 [2024-11-19 00:41:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:20,838 INFO L225 Difference]: With dead ends: 451 [2024-11-19 00:41:20,838 INFO L226 Difference]: Without dead ends: 242 [2024-11-19 00:41:20,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:41:20,840 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 97 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:20,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1493 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:41:20,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-19 00:41:20,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 212. [2024-11-19 00:41:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 176 states have (on average 1.3011363636363635) internal successors, (229), 177 states have internal predecessors, (229), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 00:41:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 287 transitions. [2024-11-19 00:41:20,870 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 287 transitions. Word has length 153 [2024-11-19 00:41:20,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:20,871 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 287 transitions. [2024-11-19 00:41:20,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-19 00:41:20,871 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 287 transitions. [2024-11-19 00:41:20,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-19 00:41:20,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:20,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, 1, 1, 1, 1, 1] [2024-11-19 00:41:20,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:41:20,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:20,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:20,876 INFO L85 PathProgramCache]: Analyzing trace with hash -724399449, now seen corresponding path program 1 times [2024-11-19 00:41:20,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:41:20,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203783069] [2024-11-19 00:41:20,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:20,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:41:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:41:20,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744363621] [2024-11-19 00:41:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:20,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:41:20,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:41:20,998 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:41:21,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:41:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:21,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 00:41:21,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:21,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:41:21,391 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 27 treesize of output 11 [2024-11-19 00:41:21,412 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 27 treesize of output 11 [2024-11-19 00:41:21,434 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 27 treesize of output 11 [2024-11-19 00:41:21,455 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 27 treesize of output 11 [2024-11-19 00:41:21,583 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 79 treesize of output 65 [2024-11-19 00:41:21,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 89 [2024-11-19 00:41:21,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:21,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 55 treesize of output 32 [2024-11-19 00:41:22,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:22,160 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 151 treesize of output 95 [2024-11-19 00:41:22,165 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 82 treesize of output 52 [2024-11-19 00:41:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 33 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-19 00:41:22,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:23,370 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 80 treesize of output 56 [2024-11-19 00:41:23,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:41:23,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203783069] [2024-11-19 00:41:23,515 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 00:41:23,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744363621] [2024-11-19 00:41:23,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744363621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:23,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:41:23,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-19 00:41:23,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141280803] [2024-11-19 00:41:23,515 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 00:41:23,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:41:23,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:41:23,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:41:23,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=256, Unknown=7, NotChecked=0, Total=342 [2024-11-19 00:41:23,517 INFO L87 Difference]: Start difference. First operand 212 states and 287 transitions. Second operand has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-19 00:41:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:24,581 INFO L93 Difference]: Finished difference Result 435 states and 583 transitions. [2024-11-19 00:41:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 00:41:24,582 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 157 [2024-11-19 00:41:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:24,583 INFO L225 Difference]: With dead ends: 435 [2024-11-19 00:41:24,583 INFO L226 Difference]: Without dead ends: 226 [2024-11-19 00:41:24,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=479, Unknown=7, NotChecked=0, Total=650 [2024-11-19 00:41:24,585 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 193 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 23 mSolverCounterUnsat, 102 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 102 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:24,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 522 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 533 Invalid, 102 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:41:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-19 00:41:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 220. [2024-11-19 00:41:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 183 states have internal predecessors, (233), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 00:41:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 291 transitions. [2024-11-19 00:41:24,613 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 291 transitions. Word has length 157 [2024-11-19 00:41:24,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:24,614 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 291 transitions. [2024-11-19 00:41:24,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-19 00:41:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 291 transitions. [2024-11-19 00:41:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-19 00:41:24,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:24,616 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-19 00:41:24,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 00:41:24,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:41:24,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:24,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:24,817 INFO L85 PathProgramCache]: Analyzing trace with hash -24096691, now seen corresponding path program 1 times [2024-11-19 00:41:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:41:24,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322228816] [2024-11-19 00:41:24,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:24,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:41:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-19 00:41:25,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:41:25,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322228816] [2024-11-19 00:41:25,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322228816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:25,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900381040] [2024-11-19 00:41:25,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:25,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:41:25,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:41:25,156 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:41:25,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 00:41:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:25,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:41:25,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:25,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 00:41:25,719 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 23 treesize of output 22 [2024-11-19 00:41:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 88 proven. 51 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2024-11-19 00:41:25,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-19 00:41:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900381040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:41:26,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:41:26,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2024-11-19 00:41:26,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95981189] [2024-11-19 00:41:26,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:41:26,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 00:41:26,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:41:26,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 00:41:26,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:41:26,088 INFO L87 Difference]: Start difference. First operand 220 states and 291 transitions. Second operand has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 6 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (55), 3 states have call predecessors, (55), 6 states have call successors, (55) [2024-11-19 00:41:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:26,736 INFO L93 Difference]: Finished difference Result 463 states and 601 transitions. [2024-11-19 00:41:26,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 00:41:26,737 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 6 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (55), 3 states have call predecessors, (55), 6 states have call successors, (55) Word has length 159 [2024-11-19 00:41:26,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:26,740 INFO L225 Difference]: With dead ends: 463 [2024-11-19 00:41:26,740 INFO L226 Difference]: Without dead ends: 246 [2024-11-19 00:41:26,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 308 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 00:41:26,741 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 470 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:26,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 801 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:41:26,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-19 00:41:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 236. [2024-11-19 00:41:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 194 states have (on average 1.2422680412371134) internal successors, (241), 195 states have internal predecessors, (241), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 00:41:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 299 transitions. [2024-11-19 00:41:26,773 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 299 transitions. Word has length 159 [2024-11-19 00:41:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:26,774 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 299 transitions. [2024-11-19 00:41:26,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 6 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (55), 3 states have call predecessors, (55), 6 states have call successors, (55) [2024-11-19 00:41:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 299 transitions. [2024-11-19 00:41:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-19 00:41:26,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:26,776 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-19 00:41:26,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 00:41:26,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:41:26,981 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:26,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash 339156198, now seen corresponding path program 1 times [2024-11-19 00:41:26,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:41:26,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078533539] [2024-11-19 00:41:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:26,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:41:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:41:27,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [391147303] [2024-11-19 00:41:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:27,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:41:27,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:41:27,062 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:41:27,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 00:41:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:41:27,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:41:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:41:27,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:41:27,866 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:41:27,867 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:41:27,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 00:41:28,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 00:41:28,073 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:28,199 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:41:28,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:41:28 BoogieIcfgContainer [2024-11-19 00:41:28,203 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:41:28,204 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:41:28,204 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:41:28,204 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:41:28,205 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:41:07" (3/4) ... [2024-11-19 00:41:28,207 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:41:28,208 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:41:28,209 INFO L158 Benchmark]: Toolchain (without parser) took 22616.83ms. Allocated memory was 163.6MB in the beginning and 662.7MB in the end (delta: 499.1MB). Free memory was 106.6MB in the beginning and 255.2MB in the end (delta: -148.7MB). Peak memory consumption was 350.5MB. Max. memory is 16.1GB. [2024-11-19 00:41:28,209 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 163.6MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:41:28,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.64ms. Allocated memory is still 163.6MB. Free memory was 106.1MB in the beginning and 89.8MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 00:41:28,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.95ms. Allocated memory is still 163.6MB. Free memory was 89.8MB in the beginning and 85.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:41:28,210 INFO L158 Benchmark]: Boogie Preprocessor took 97.51ms. Allocated memory is still 163.6MB. Free memory was 85.6MB in the beginning and 80.5MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 00:41:28,211 INFO L158 Benchmark]: RCFGBuilder took 890.12ms. Allocated memory was 163.6MB in the beginning and 234.9MB in the end (delta: 71.3MB). Free memory was 80.5MB in the beginning and 184.7MB in the end (delta: -104.1MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-11-19 00:41:28,211 INFO L158 Benchmark]: TraceAbstraction took 21128.37ms. Allocated memory was 234.9MB in the beginning and 662.7MB in the end (delta: 427.8MB). Free memory was 183.6MB in the beginning and 255.2MB in the end (delta: -71.6MB). Peak memory consumption was 355.2MB. Max. memory is 16.1GB. [2024-11-19 00:41:28,211 INFO L158 Benchmark]: Witness Printer took 4.71ms. Allocated memory is still 662.7MB. Free memory is still 255.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:41:28,212 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.24ms. Allocated memory is still 163.6MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.64ms. Allocated memory is still 163.6MB. Free memory was 106.1MB in the beginning and 89.8MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.95ms. Allocated memory is still 163.6MB. Free memory was 89.8MB in the beginning and 85.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.51ms. Allocated memory is still 163.6MB. Free memory was 85.6MB in the beginning and 80.5MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 890.12ms. Allocated memory was 163.6MB in the beginning and 234.9MB in the end (delta: 71.3MB). Free memory was 80.5MB in the beginning and 184.7MB in the end (delta: -104.1MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21128.37ms. Allocated memory was 234.9MB in the beginning and 662.7MB in the end (delta: 427.8MB). Free memory was 183.6MB in the beginning and 255.2MB in the end (delta: -71.6MB). Peak memory consumption was 355.2MB. Max. memory is 16.1GB. * Witness Printer took 4.71ms. Allocated memory is still 662.7MB. Free memory is still 255.2MB. 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 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L28-L30] float float_Array_0[1] = { 2.4 }; [L28-L30] float float_Array_0[1] = { 2.4 }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 500 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 500 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 8, 100 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 8, 100 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 8, 100 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] FCALL updateLastVariables() [L104] CALL updateVariables() [L63] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L64] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L67] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] double_Array_0[0] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[0] [L70] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L70] EXPR double_Array_0[0] [L70] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] double_Array_0[1] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[1] [L72] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L72] EXPR double_Array_0[1] [L72] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[1][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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L80] EXPR 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] EXPR 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] signed_char_Array_0[1][1] = __VERIFIER_nondet_char() [L83] EXPR signed_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[1][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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR signed_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] signed_char_Array_0[0][2] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L89] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9: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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L104] RET updateVariables() [L105] CALL step() [L43] EXPR signed_char_Array_0[0][2] [L43] EXPR signed_char_Array_0[1][1] [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR signed_char_Array_0[1][0] [L43] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L43] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L43] signed_char_Array_0[1][2] = ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))) [L44] EXPR signed_char_Array_0[1][0] [L44] EXPR signed_char_Array_0[0][0] [L44] EXPR signed_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] EXPR signed_char_Array_0[0][0] & signed_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] signed long int stepLocal_0 = (~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1]); [L45] EXPR 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(stepLocal_0 >= signed_char_Array_0[0][1]) [L48] EXPR double_Array_0[0] [L48] double_Array_0[2] = double_Array_0[0] [L50] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] EXPR ((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]) [L50] EXPR signed_char_Array_0[0][2] [L50] EXPR ((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] signed_short_int_Array_0[0] = ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]))) [L51] EXPR signed_char_Array_0[0][0] [L51] EXPR unsigned_short_int_Array_0[1] [L51] signed long int stepLocal_1 = signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]; [L52] COND FALSE !(stepLocal_1 < -100) [L55] EXPR BOOL_unsigned_char_Array_0[2] [L55] EXPR BOOL_unsigned_char_Array_0[2] && 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L55] EXPR BOOL_unsigned_char_Array_0[2] && 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L55] BOOL_unsigned_char_Array_0[0] = (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]) [L57] EXPR double_Array_0[1] [L57] float_Array_0[0] = double_Array_0[1] [L58] EXPR 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L59] EXPR signed_char_Array_0[1][0] [L59] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] EXPR ((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1) [L59] EXPR signed_char_Array_0[0][0] [L59] EXPR ((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] unsigned_short_int_Array_0[0] = (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR signed_char_Array_0[1][2] [L96] EXPR signed_char_Array_0[0][2] [L96] EXPR signed_char_Array_0[1][1] [L96] EXPR signed_char_Array_0[0][1] [L96] EXPR signed_char_Array_0[1][0] [L96] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) [L96] EXPR signed_char_Array_0[0][1] [L96] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))) [L96] EXPR signed_char_Array_0[1][0] [L96] EXPR signed_char_Array_0[0][0] [L96] EXPR signed_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR signed_char_Array_0[0][0] & signed_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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])) [L96] EXPR double_Array_0[2] [L96] EXPR double_Array_0[0] [L96] EXPR (((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96-L97] return (((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) ; [L106] RET, EXPR property() [L106] 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, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.9s, OverallIterations: 10, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 102 mSolverCounterUnknown, 1310 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1286 mSDsluCounter, 6707 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5286 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2467 IncrementalHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 1421 mSDtfsCounter, 2467 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1092 GetRequests, 977 SyntacticMatches, 5 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=9, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 58 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 2331 NumberOfCodeBlocks, 2331 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2150 ConstructedInterpolants, 1 QuantifiedInterpolants, 10568 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2205 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 9324/9576 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-19 00:41:28,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.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 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:41:30,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:41:30,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:41:30,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:41:30,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:41:30,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:41:30,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:41:30,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:41:30,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:41:30,677 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:41:30,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:41:30,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:41:30,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:41:30,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:41:30,681 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:41:30,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:41:30,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:41:30,682 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:41:30,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:41:30,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:41:30,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:41:30,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:41:30,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:41:30,688 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:41:30,688 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:41:30,688 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:41:30,688 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:41:30,689 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:41:30,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:41:30,689 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:41:30,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:41:30,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:41:30,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:41:30,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:41:30,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:41:30,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:41:30,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:41:30,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:41:30,693 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:41:30,693 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:41:30,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:41:30,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:41:30,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:41:30,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:41:30,694 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 -> 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f [2024-11-19 00:41:31,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:41:31,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:41:31,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:41:31,064 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:41:31,066 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:41:31,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i [2024-11-19 00:41:32,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:41:32,734 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:41:32,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i [2024-11-19 00:41:32,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed31faeb/aa5a71ed28274d928225d5e5d173a210/FLAG81d988c41 [2024-11-19 00:41:33,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed31faeb/aa5a71ed28274d928225d5e5d173a210 [2024-11-19 00:41:33,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:41:33,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:41:33,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:41:33,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:41:33,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:41:33,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:41:33" (1/1) ... [2024-11-19 00:41:33,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c944d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33, skipping insertion in model container [2024-11-19 00:41:33,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:41:33" (1/1) ... [2024-11-19 00:41:33,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:41:33,335 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-92.i[916,929] [2024-11-19 00:41:33,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:41:33,444 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:41:33,459 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-92.i[916,929] [2024-11-19 00:41:33,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:41:33,532 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:41:33,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33 WrapperNode [2024-11-19 00:41:33,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:41:33,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:41:33,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:41:33,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:41:33,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33" (1/1) ... [2024-11-19 00:41:33,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33" (1/1) ... [2024-11-19 00:41:33,609 INFO L138 Inliner]: procedures = 36, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 435 [2024-11-19 00:41:33,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:41:33,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:41:33,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:41:33,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:41:33,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33" (1/1) ... [2024-11-19 00:41:33,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33" (1/1) ... [2024-11-19 00:41:33,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33" (1/1) ... [2024-11-19 00:41:33,672 INFO L175 MemorySlicer]: Split 123 memory accesses to 7 slices as follows [2, 21, 23, 3, 61, 3, 10]. 50 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 3, 3, 1, 6, 1, 2]. The 18 writes are split as follows [0, 4, 4, 1, 6, 1, 2]. [2024-11-19 00:41:33,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33" (1/1) ... [2024-11-19 00:41:33,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33" (1/1) ... [2024-11-19 00:41:33,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33" (1/1) ... [2024-11-19 00:41:33,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33" (1/1) ... [2024-11-19 00:41:33,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33" (1/1) ... [2024-11-19 00:41:33,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33" (1/1) ... [2024-11-19 00:41:33,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:41:33,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:41:33,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:41:33,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:41:33,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33" (1/1) ... [2024-11-19 00:41:33,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:41:33,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:41:33,794 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-19 00:41:33,801 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-19 00:41:33,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:41:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 00:41:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 00:41:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 00:41:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 00:41:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-19 00:41:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-19 00:41:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-19 00:41:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 00:41:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 00:41:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 00:41:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 00:41:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-19 00:41:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-19 00:41:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-19 00:41:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:41:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:41:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:41:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:41:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:41:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:41:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 00:41:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 00:41:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 00:41:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 00:41:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 00:41:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 00:41:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 00:41:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-19 00:41:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:41:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:41:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:41:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:41:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:41:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:41:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 00:41:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:41:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:41:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:41:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:41:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 00:41:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-19 00:41:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-19 00:41:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 00:41:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 00:41:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 00:41:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 00:41:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-19 00:41:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-19 00:41:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-19 00:41:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 00:41:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 00:41:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 00:41:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 00:41:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 00:41:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-19 00:41:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-19 00:41:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:41:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:41:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:41:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:41:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 00:41:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-19 00:41:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-19 00:41:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:41:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:41:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:41:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:41:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 00:41:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-19 00:41:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-19 00:41:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:41:33,870 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:41:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:41:33,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:41:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:41:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:41:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:41:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:41:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:41:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:41:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 00:41:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 00:41:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 00:41:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 00:41:33,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 00:41:33,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 00:41:33,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-19 00:41:33,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-19 00:41:34,064 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:41:34,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:41:35,036 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-19 00:41:35,036 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:41:35,053 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:41:35,053 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:41:35,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:41:35 BoogieIcfgContainer [2024-11-19 00:41:35,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:41:35,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:41:35,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:41:35,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:41:35,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:41:33" (1/3) ... [2024-11-19 00:41:35,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2901c6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:41:35, skipping insertion in model container [2024-11-19 00:41:35,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:33" (2/3) ... [2024-11-19 00:41:35,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2901c6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:41:35, skipping insertion in model container [2024-11-19 00:41:35,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:41:35" (3/3) ... [2024-11-19 00:41:35,064 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-92.i [2024-11-19 00:41:35,080 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:41:35,081 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:41:35,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:41:35,158 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;@46109d08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:41:35,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:41:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 84 states have internal predecessors, (113), 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-19 00:41:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-19 00:41:35,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:35,176 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] [2024-11-19 00:41:35,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:35,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:35,182 INFO L85 PathProgramCache]: Analyzing trace with hash 923876049, now seen corresponding path program 1 times [2024-11-19 00:41:35,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:35,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262868353] [2024-11-19 00:41:35,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:35,196 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-19 00:41:35,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:35,200 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-19 00:41:35,202 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-19 00:41:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:35,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:41:35,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:35,721 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-19 00:41:35,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:35,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:35,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262868353] [2024-11-19 00:41:35,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262868353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:35,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:35,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:41:35,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224840982] [2024-11-19 00:41:35,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:35,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:41:35,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:35,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:41:35,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:41:35,758 INFO L87 Difference]: Start difference. First operand has 105 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 84 states have internal predecessors, (113), 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 31.5) internal successors, (63), 2 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-19 00:41:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:35,786 INFO L93 Difference]: Finished difference Result 203 states and 315 transitions. [2024-11-19 00:41:35,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:41:35,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 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 151 [2024-11-19 00:41:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:35,796 INFO L225 Difference]: With dead ends: 203 [2024-11-19 00:41:35,797 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 00:41:35,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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-19 00:41:35,803 INFO L432 NwaCegarLoop]: 144 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, 144 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-19 00:41:35,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:41:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 00:41:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-19 00:41:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 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-19 00:41:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2024-11-19 00:41:35,842 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 151 [2024-11-19 00:41:35,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:35,843 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2024-11-19 00:41:35,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 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-19 00:41:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2024-11-19 00:41:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-19 00:41:35,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:35,847 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] [2024-11-19 00:41:35,857 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-19 00:41:36,047 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-19 00:41:36,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:36,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:36,049 INFO L85 PathProgramCache]: Analyzing trace with hash -262882897, now seen corresponding path program 1 times [2024-11-19 00:41:36,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:36,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131942960] [2024-11-19 00:41:36,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:36,050 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-19 00:41:36,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:36,052 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-19 00:41:36,053 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-19 00:41:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:36,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:41:36,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:36,590 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-19 00:41:36,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:36,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:36,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131942960] [2024-11-19 00:41:36,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131942960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:36,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:36,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:41:36,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966196312] [2024-11-19 00:41:36,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:36,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:41:36,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:36,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:41:36,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:41:36,597 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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-19 00:41:36,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:36,868 INFO L93 Difference]: Finished difference Result 208 states and 298 transitions. [2024-11-19 00:41:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:41:36,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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 151 [2024-11-19 00:41:36,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:36,872 INFO L225 Difference]: With dead ends: 208 [2024-11-19 00:41:36,872 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 00:41:36,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 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-19 00:41:36,874 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:36,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 789 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:41:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 00:41:36,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-11-19 00:41:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 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-19 00:41:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 152 transitions. [2024-11-19 00:41:36,889 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 152 transitions. Word has length 151 [2024-11-19 00:41:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:36,891 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 152 transitions. [2024-11-19 00:41:36,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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-19 00:41:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 152 transitions. [2024-11-19 00:41:36,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-19 00:41:36,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:36,894 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] [2024-11-19 00:41:36,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:41:37,095 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-19 00:41:37,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:37,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:37,096 INFO L85 PathProgramCache]: Analyzing trace with hash -261035855, now seen corresponding path program 1 times [2024-11-19 00:41:37,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:37,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670970879] [2024-11-19 00:41:37,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:37,097 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-19 00:41:37,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:37,099 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-19 00:41:37,100 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-19 00:41:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:37,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 00:41:37,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:37,679 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-19 00:41:37,831 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 33 treesize of output 32 [2024-11-19 00:41:37,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:37,910 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 39 treesize of output 21 [2024-11-19 00:41:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-19 00:41:37,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-19 00:41:38,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:38,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670970879] [2024-11-19 00:41:38,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670970879] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:41:38,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:41:38,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2024-11-19 00:41:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785719557] [2024-11-19 00:41:38,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:41:38,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:41:38,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:38,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:41:38,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:41:38,290 INFO L87 Difference]: Start difference. First operand 109 states and 152 transitions. Second operand has 12 states, 10 states have (on average 7.3) internal successors, (73), 12 states have internal predecessors, (73), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-19 00:41:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:39,289 INFO L93 Difference]: Finished difference Result 227 states and 311 transitions. [2024-11-19 00:41:39,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:41:39,290 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.3) internal successors, (73), 12 states have internal predecessors, (73), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 151 [2024-11-19 00:41:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:39,292 INFO L225 Difference]: With dead ends: 227 [2024-11-19 00:41:39,292 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 00:41:39,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:41:39,294 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 368 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:39,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 413 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:41:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 00:41:39,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2024-11-19 00:41:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 00:41:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 157 transitions. [2024-11-19 00:41:39,309 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 157 transitions. Word has length 151 [2024-11-19 00:41:39,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:39,310 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 157 transitions. [2024-11-19 00:41:39,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.3) internal successors, (73), 12 states have internal predecessors, (73), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-19 00:41:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 157 transitions. [2024-11-19 00:41:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-19 00:41:39,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:39,312 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] [2024-11-19 00:41:39,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 00:41:39,512 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-19 00:41:39,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:39,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:39,514 INFO L85 PathProgramCache]: Analyzing trace with hash 161665971, now seen corresponding path program 1 times [2024-11-19 00:41:39,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:39,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373588389] [2024-11-19 00:41:39,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:39,515 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-19 00:41:39,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:39,518 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-19 00:41:39,519 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-19 00:41:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:40,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 00:41:40,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:40,035 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 12 treesize of output 8 [2024-11-19 00:41:40,191 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 37 treesize of output 17 [2024-11-19 00:41:40,274 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 37 treesize of output 17 [2024-11-19 00:41:40,357 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 32 treesize of output 27 [2024-11-19 00:41:40,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:40,535 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 47 treesize of output 30 [2024-11-19 00:41:41,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:41,128 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 49 treesize of output 47 [2024-11-19 00:41:41,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:41,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 40 [2024-11-19 00:41:41,296 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 29 treesize of output 17 [2024-11-19 00:41:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 485 proven. 33 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-19 00:41:41,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:43,072 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 32 treesize of output 20 [2024-11-19 00:41:43,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:43,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373588389] [2024-11-19 00:41:43,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373588389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:43,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [4255362] [2024-11-19 00:41:43,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:43,444 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:41:43,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:41:43,446 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:41:43,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-19 00:41:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:44,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 00:41:44,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:44,906 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 12 treesize of output 8 [2024-11-19 00:41:45,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-19 00:41:45,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-19 00:41:46,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:46,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2024-11-19 00:41:46,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:46,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2024-11-19 00:41:48,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:48,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 60 [2024-11-19 00:41:48,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:48,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 41 [2024-11-19 00:41:48,736 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 25 treesize of output 17 [2024-11-19 00:41:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 543 proven. 33 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-19 00:41:49,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:49,492 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 32 treesize of output 20 [2024-11-19 00:41:49,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [4255362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:49,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:41:49,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2024-11-19 00:41:49,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094349003] [2024-11-19 00:41:49,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:41:49,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 00:41:49,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:49,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 00:41:49,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 00:41:49,751 INFO L87 Difference]: Start difference. First operand 117 states and 157 transitions. Second operand has 28 states, 24 states have (on average 5.375) internal successors, (129), 26 states have internal predecessors, (129), 12 states have call successors, (38), 10 states have call predecessors, (38), 12 states have return successors, (38), 10 states have call predecessors, (38), 12 states have call successors, (38) [2024-11-19 00:42:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:42:01,351 INFO L93 Difference]: Finished difference Result 251 states and 327 transitions. [2024-11-19 00:42:01,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 00:42:01,352 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 5.375) internal successors, (129), 26 states have internal predecessors, (129), 12 states have call successors, (38), 10 states have call predecessors, (38), 12 states have return successors, (38), 10 states have call predecessors, (38), 12 states have call successors, (38) Word has length 151 [2024-11-19 00:42:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:42:01,354 INFO L225 Difference]: With dead ends: 251 [2024-11-19 00:42:01,354 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 00:42:01,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 333 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=561, Invalid=1601, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 00:42:01,356 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 569 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:42:01,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 595 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2024-11-19 00:42:01,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 00:42:01,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-11-19 00:42:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 106 states have internal predecessors, (130), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 00:42:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 168 transitions. [2024-11-19 00:42:01,379 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 168 transitions. Word has length 151 [2024-11-19 00:42:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:42:01,379 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 168 transitions. [2024-11-19 00:42:01,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 5.375) internal successors, (129), 26 states have internal predecessors, (129), 12 states have call successors, (38), 10 states have call predecessors, (38), 12 states have return successors, (38), 10 states have call predecessors, (38), 12 states have call successors, (38) [2024-11-19 00:42:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 168 transitions. [2024-11-19 00:42:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 00:42:01,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:42:01,382 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] [2024-11-19 00:42:01,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 00:42:01,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-19 00:42:01,782 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 00:42:01,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:42:01,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:42:01,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1022987001, now seen corresponding path program 1 times [2024-11-19 00:42:01,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:42:01,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338848493] [2024-11-19 00:42:01,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:01,785 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-19 00:42:01,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:42:01,787 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-19 00:42:01,788 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-19 00:42:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:02,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:42:02,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:42:03,078 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 39 treesize of output 21 [2024-11-19 00:42:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 204 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 00:42:03,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:42:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-19 00:42:04,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:42:04,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338848493] [2024-11-19 00:42:04,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338848493] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:42:04,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:42:04,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-19 00:42:04,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273053387] [2024-11-19 00:42:04,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:42:04,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:42:04,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:42:04,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:42:04,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:42:04,315 INFO L87 Difference]: Start difference. First operand 133 states and 168 transitions. Second operand has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-19 00:42:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:42:05,831 INFO L93 Difference]: Finished difference Result 273 states and 342 transitions. [2024-11-19 00:42:05,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:42:05,832 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) Word has length 153 [2024-11-19 00:42:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:42:05,834 INFO L225 Difference]: With dead ends: 273 [2024-11-19 00:42:05,834 INFO L226 Difference]: Without dead ends: 143 [2024-11-19 00:42:05,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:42:05,836 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 71 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:42:05,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 485 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 00:42:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-19 00:42:05,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2024-11-19 00:42:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 109 states have internal predecessors, (132), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 00:42:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2024-11-19 00:42:05,870 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 153 [2024-11-19 00:42:05,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:42:05,870 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2024-11-19 00:42:05,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-19 00:42:05,870 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2024-11-19 00:42:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 00:42:05,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:42:05,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, 1] [2024-11-19 00:42:05,890 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-19 00:42:06,075 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-19 00:42:06,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:42:06,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:42:06,076 INFO L85 PathProgramCache]: Analyzing trace with hash 205338551, now seen corresponding path program 1 times [2024-11-19 00:42:06,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:42:06,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626450982] [2024-11-19 00:42:06,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:06,077 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-19 00:42:06,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:42:06,080 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-19 00:42:06,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 (8)] Waiting until timeout for monitored process [2024-11-19 00:42:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:06,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:42:06,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:42:07,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-19 00:42:07,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:42:07,629 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 28 treesize of output 14 [2024-11-19 00:42:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 204 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 00:42:07,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:42:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-19 00:42:09,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:42:09,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626450982] [2024-11-19 00:42:09,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626450982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:42:09,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:42:09,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2024-11-19 00:42:09,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960055763] [2024-11-19 00:42:09,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:42:09,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 00:42:09,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:42:09,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 00:42:09,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:42:09,179 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-19 00:42:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:42:11,777 INFO L93 Difference]: Finished difference Result 281 states and 346 transitions. [2024-11-19 00:42:11,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 00:42:11,777 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) Word has length 153 [2024-11-19 00:42:11,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:42:11,779 INFO L225 Difference]: With dead ends: 281 [2024-11-19 00:42:11,779 INFO L226 Difference]: Without dead ends: 147 [2024-11-19 00:42:11,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 291 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2024-11-19 00:42:11,780 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 356 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:42:11,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 700 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 00:42:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-19 00:42:11,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2024-11-19 00:42:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 112 states have (on average 1.1964285714285714) internal successors, (134), 112 states have internal predecessors, (134), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 00:42:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 172 transitions. [2024-11-19 00:42:11,820 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 172 transitions. Word has length 153 [2024-11-19 00:42:11,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:42:11,821 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 172 transitions. [2024-11-19 00:42:11,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-19 00:42:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 172 transitions. [2024-11-19 00:42:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 00:42:11,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:42:11,825 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] [2024-11-19 00:42:11,841 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-19 00:42:12,026 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-19 00:42:12,027 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:42:12,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:42:12,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1435472562, now seen corresponding path program 1 times [2024-11-19 00:42:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:42:12,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401998137] [2024-11-19 00:42:12,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:12,028 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-19 00:42:12,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:42:12,031 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-19 00:42:12,033 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-19 00:42:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:12,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 00:42:12,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:42:12,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:42:13,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-19 00:42:14,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2024-11-19 00:42:16,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:42:16,366 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 76 treesize of output 65 [2024-11-19 00:42:17,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:42:17,480 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 86 treesize of output 78