./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-17.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 cf9505dc2ef67c73c85afca644466d8e73c9d84bcc3bdb502bf9c06807a1f2ea --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:06:49,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:06:49,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:06:49,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:06:49,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:06:49,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:06:49,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:06:49,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:06:49,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:06:49,374 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:06:49,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:06:49,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:06:49,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:06:49,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:06:49,376 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:06:49,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:06:49,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:06:49,377 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:06:49,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:06:49,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:06:49,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:06:49,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:06:49,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:06:49,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:06:49,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:06:49,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:06:49,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:06:49,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:06:49,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:06:49,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:06:49,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:06:49,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:06:49,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:06:49,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:06:49,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:06:49,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:06:49,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:06:49,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:06:49,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:06:49,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:06:49,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:06:49,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:06:49,384 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 -> cf9505dc2ef67c73c85afca644466d8e73c9d84bcc3bdb502bf9c06807a1f2ea [2024-11-12 07:06:49,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:06:49,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:06:49,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:06:49,641 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:06:49,641 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:06:49,642 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-17.i [2024-11-12 07:06:51,096 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:06:51,256 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:06:51,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i [2024-11-12 07:06:51,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e62cb55/2b54f6290b244ef0b21d57ae49fd2f3e/FLAGd935dbde0 [2024-11-12 07:06:51,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e62cb55/2b54f6290b244ef0b21d57ae49fd2f3e [2024-11-12 07:06:51,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:06:51,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:06:51,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:06:51,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:06:51,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:06:51,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:06:51" (1/1) ... [2024-11-12 07:06:51,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e3f50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51, skipping insertion in model container [2024-11-12 07:06:51,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:06:51" (1/1) ... [2024-11-12 07:06:51,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:06:51,448 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-17.i[916,929] [2024-11-12 07:06:51,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:06:51,526 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:06:51,537 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-17.i[916,929] [2024-11-12 07:06:51,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:06:51,602 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:06:51,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51 WrapperNode [2024-11-12 07:06:51,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:06:51,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:06:51,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:06:51,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:06:51,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51" (1/1) ... [2024-11-12 07:06:51,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51" (1/1) ... [2024-11-12 07:06:51,657 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 626 [2024-11-12 07:06:51,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:06:51,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:06:51,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:06:51,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:06:51,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51" (1/1) ... [2024-11-12 07:06:51,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51" (1/1) ... [2024-11-12 07:06:51,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51" (1/1) ... [2024-11-12 07:06:51,704 INFO L175 MemorySlicer]: Split 156 memory accesses to 7 slices as follows [2, 14, 89, 3, 21, 22, 5]. 57 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 7, 1, 3, 2, 1]. The 19 writes are split as follows [0, 2, 7, 1, 5, 3, 1]. [2024-11-12 07:06:51,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51" (1/1) ... [2024-11-12 07:06:51,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51" (1/1) ... [2024-11-12 07:06:51,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51" (1/1) ... [2024-11-12 07:06:51,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51" (1/1) ... [2024-11-12 07:06:51,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51" (1/1) ... [2024-11-12 07:06:51,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51" (1/1) ... [2024-11-12 07:06:51,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:06:51,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:06:51,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:06:51,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:06:51,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51" (1/1) ... [2024-11-12 07:06:51,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:06:51,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:06:51,778 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-12 07:06:51,785 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-12 07:06:51,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:06:51,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-12 07:06:51,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-12 07:06:51,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-12 07:06:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-12 07:06:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-12 07:06:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-12 07:06:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-12 07:06:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:06:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:06:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 07:06:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 07:06:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 07:06:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 07:06:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-12 07:06:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-12 07:06:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-12 07:06:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-12 07:06:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-12 07:06:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-12 07:06:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-12 07:06:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-12 07:06:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:06:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:06:51,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 07:06:51,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 07:06:51,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 07:06:51,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 07:06:51,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-12 07:06:51,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-12 07:06:51,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-12 07:06:51,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-12 07:06:51,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-12 07:06:51,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-12 07:06:51,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-12 07:06:51,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-12 07:06:51,919 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:06:51,919 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:06:51,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:06:51,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:06:51,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 07:06:51,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 07:06:51,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 07:06:51,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 07:06:51,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-12 07:06:51,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:06:51,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:06:52,068 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:06:52,070 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:06:52,638 INFO L? ?]: Removed 167 outVars from TransFormulas that were not future-live. [2024-11-12 07:06:52,638 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:06:52,655 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:06:52,655 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:06:52,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:06:52 BoogieIcfgContainer [2024-11-12 07:06:52,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:06:52,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:06:52,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:06:52,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:06:52,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:06:51" (1/3) ... [2024-11-12 07:06:52,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13684711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:06:52, skipping insertion in model container [2024-11-12 07:06:52,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:06:51" (2/3) ... [2024-11-12 07:06:52,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13684711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:06:52, skipping insertion in model container [2024-11-12 07:06:52,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:06:52" (3/3) ... [2024-11-12 07:06:52,669 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-17.i [2024-11-12 07:06:52,684 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:06:52,684 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:06:52,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:06:52,747 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;@6bed1ac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:06:52,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:06:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:06:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-12 07:06:52,763 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:06:52,764 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:06:52,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:06:52,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:06:52,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1809069754, now seen corresponding path program 1 times [2024-11-12 07:06:52,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:06:52,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011588957] [2024-11-12 07:06:52,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:06:52,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:06:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:06:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:06:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:06:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:06:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:06:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:06:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:06:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:06:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:06:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:06:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:06:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:06:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:06:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:06:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:06:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:06:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:06:53,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:06:53,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011588957] [2024-11-12 07:06:53,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011588957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:06:53,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:06:53,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:06:53,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466420125] [2024-11-12 07:06:53,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:06:53,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:06:53,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:06:53,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:06:53,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:06:53,184 INFO L87 Difference]: Start difference. First operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:06:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:06:53,216 INFO L93 Difference]: Finished difference Result 281 states and 438 transitions. [2024-11-12 07:06:53,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:06:53,219 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-12 07:06:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:06:53,225 INFO L225 Difference]: With dead ends: 281 [2024-11-12 07:06:53,228 INFO L226 Difference]: Without dead ends: 140 [2024-11-12 07:06:53,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-12 07:06:53,236 INFO L435 NwaCegarLoop]: 207 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, 207 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-12 07:06:53,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:06:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-12 07:06:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-12 07:06:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:06:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2024-11-12 07:06:53,290 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 141 [2024-11-12 07:06:53,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:06:53,290 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2024-11-12 07:06:53,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:06:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2024-11-12 07:06:53,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-12 07:06:53,294 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:06:53,294 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:06:53,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:06:53,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:06:53,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:06:53,296 INFO L85 PathProgramCache]: Analyzing trace with hash 676775910, now seen corresponding path program 1 times [2024-11-12 07:06:53,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:06:53,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931327723] [2024-11-12 07:06:53,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:06:53,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:06:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:06:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:06:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:06:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:06:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:06:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:06:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:06:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:06:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:06:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:06:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:06:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:06:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:06:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:06:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:06:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:06:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:06:53,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:06:53,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931327723] [2024-11-12 07:06:53,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931327723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:06:53,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:06:53,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:06:53,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692754293] [2024-11-12 07:06:53,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:06:53,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:06:53,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:06:53,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:06:53,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:06:53,577 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:06:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:06:53,611 INFO L93 Difference]: Finished difference Result 279 states and 414 transitions. [2024-11-12 07:06:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:06:53,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-12 07:06:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:06:53,614 INFO L225 Difference]: With dead ends: 279 [2024-11-12 07:06:53,614 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 07:06:53,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-12 07:06:53,615 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:06:53,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:06:53,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 07:06:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-12 07:06:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:06:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2024-11-12 07:06:53,629 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 141 [2024-11-12 07:06:53,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:06:53,631 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2024-11-12 07:06:53,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:06:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2024-11-12 07:06:53,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-12 07:06:53,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:06:53,636 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:06:53,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:06:53,636 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:06:53,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:06:53,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1999216472, now seen corresponding path program 1 times [2024-11-12 07:06:53,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:06:53,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320390642] [2024-11-12 07:06:53,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:06:53,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:06:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:06:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:06:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:06:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:06:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:06:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:06:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:06:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:06:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:06:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:06:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:06:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:06:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:06:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:06:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:06:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:06:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:06:53,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:06:53,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320390642] [2024-11-12 07:06:53,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320390642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:06:53,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:06:53,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:06:53,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011346670] [2024-11-12 07:06:53,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:06:53,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:06:53,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:06:53,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:06:53,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:06:53,925 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:06:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:06:53,964 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2024-11-12 07:06:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:06:53,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2024-11-12 07:06:53,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:06:53,966 INFO L225 Difference]: With dead ends: 283 [2024-11-12 07:06:53,966 INFO L226 Difference]: Without dead ends: 144 [2024-11-12 07:06:53,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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-12 07:06:53,968 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:06:53,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:06:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-12 07:06:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-12 07:06:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:06:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-11-12 07:06:53,987 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 141 [2024-11-12 07:06:53,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:06:53,987 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-11-12 07:06:53,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:06:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-11-12 07:06:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 07:06:53,993 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:06:53,993 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:06:53,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:06:53,993 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:06:53,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:06:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash 551308611, now seen corresponding path program 1 times [2024-11-12 07:06:53,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:06:53,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699542104] [2024-11-12 07:06:53,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:06:53,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:06:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:06:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:06:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:06:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:06:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:06:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:06:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:06:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:06:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:06:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:06:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:06:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:06:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:06:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:06:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:06:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:06:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:06:54,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:06:54,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699542104] [2024-11-12 07:06:54,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699542104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:06:54,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:06:54,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:06:54,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837148039] [2024-11-12 07:06:54,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:06:54,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:06:54,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:06:54,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:06:54,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:06:54,962 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:06:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:06:55,071 INFO L93 Difference]: Finished difference Result 288 states and 423 transitions. [2024-11-12 07:06:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:06:55,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-12 07:06:55,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:06:55,073 INFO L225 Difference]: With dead ends: 288 [2024-11-12 07:06:55,073 INFO L226 Difference]: Without dead ends: 147 [2024-11-12 07:06:55,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:06:55,075 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 90 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:06:55,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 691 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:06:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-12 07:06:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-12 07:06:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.4140625) internal successors, (181), 128 states have internal predecessors, (181), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:06:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2024-11-12 07:06:55,094 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 143 [2024-11-12 07:06:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:06:55,095 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2024-11-12 07:06:55,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:06:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2024-11-12 07:06:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 07:06:55,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:06:55,097 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:06:55,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:06:55,098 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:06:55,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:06:55,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1231366981, now seen corresponding path program 1 times [2024-11-12 07:06:55,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:06:55,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696354507] [2024-11-12 07:06:55,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:06:55,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:06:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:06:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:06:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:06:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:06:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:06:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:06:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:06:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:06:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:06:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:06:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:06:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:06:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:06:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:06:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:06:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:06:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:06:55,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:06:55,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696354507] [2024-11-12 07:06:55,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696354507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:06:55,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:06:55,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:06:55,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827190509] [2024-11-12 07:06:55,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:06:55,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:06:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:06:55,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:06:55,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:06:55,950 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:06:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:06:56,207 INFO L93 Difference]: Finished difference Result 578 states and 847 transitions. [2024-11-12 07:06:56,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:06:56,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-12 07:06:56,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:06:56,210 INFO L225 Difference]: With dead ends: 578 [2024-11-12 07:06:56,212 INFO L226 Difference]: Without dead ends: 435 [2024-11-12 07:06:56,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:06:56,213 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 418 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:06:56,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1510 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:06:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-12 07:06:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 429. [2024-11-12 07:06:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 377 states have (on average 1.4164456233421752) internal successors, (534), 377 states have internal predecessors, (534), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 07:06:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 630 transitions. [2024-11-12 07:06:56,248 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 630 transitions. Word has length 143 [2024-11-12 07:06:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:06:56,250 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 630 transitions. [2024-11-12 07:06:56,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:06:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 630 transitions. [2024-11-12 07:06:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 07:06:56,252 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:06:56,253 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:06:56,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:06:56,253 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:06:56,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:06:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2016773691, now seen corresponding path program 1 times [2024-11-12 07:06:56,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:06:56,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133701801] [2024-11-12 07:06:56,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:06:56,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:06:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:06:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:06:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:06:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:06:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:06:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:06:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:06:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:06:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:06:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:06:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:06:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:06:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:06:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:06:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:06:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:06:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:06:56,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:06:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133701801] [2024-11-12 07:06:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133701801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:06:56,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:06:56,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:06:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344934878] [2024-11-12 07:06:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:06:56,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:06:56,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:06:56,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:06:56,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:06:56,903 INFO L87 Difference]: Start difference. First operand 429 states and 630 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:06:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:06:57,038 INFO L93 Difference]: Finished difference Result 1070 states and 1561 transitions. [2024-11-12 07:06:57,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:06:57,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2024-11-12 07:06:57,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:06:57,042 INFO L225 Difference]: With dead ends: 1070 [2024-11-12 07:06:57,043 INFO L226 Difference]: Without dead ends: 644 [2024-11-12 07:06:57,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:06:57,046 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 94 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:06:57,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 953 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:06:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-12 07:06:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 639. [2024-11-12 07:06:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 578 states have (on average 1.4169550173010381) internal successors, (819), 581 states have internal predecessors, (819), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 07:06:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 927 transitions. [2024-11-12 07:06:57,097 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 927 transitions. Word has length 143 [2024-11-12 07:06:57,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:06:57,097 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 927 transitions. [2024-11-12 07:06:57,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:06:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 927 transitions. [2024-11-12 07:06:57,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 07:06:57,100 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:06:57,100 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:06:57,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:06:57,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:06:57,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:06:57,101 INFO L85 PathProgramCache]: Analyzing trace with hash 371508852, now seen corresponding path program 1 times [2024-11-12 07:06:57,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:06:57,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938594322] [2024-11-12 07:06:57,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:06:57,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:06:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:06:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:06:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:06:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:06:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:06:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:06:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:06:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:06:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:06:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:06:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:06:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:06:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:06:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:06:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:06:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:06:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:06:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:06:58,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:06:58,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938594322] [2024-11-12 07:06:58,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938594322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:06:58,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:06:58,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:06:58,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536316682] [2024-11-12 07:06:58,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:06:58,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:06:58,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:06:58,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:06:58,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:06:58,105 INFO L87 Difference]: Start difference. First operand 639 states and 927 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:06:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:06:58,278 INFO L93 Difference]: Finished difference Result 1069 states and 1551 transitions. [2024-11-12 07:06:58,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:06:58,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2024-11-12 07:06:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:06:58,284 INFO L225 Difference]: With dead ends: 1069 [2024-11-12 07:06:58,284 INFO L226 Difference]: Without dead ends: 857 [2024-11-12 07:06:58,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:06:58,286 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 195 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:06:58,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1770 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:06:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-12 07:06:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 431. [2024-11-12 07:06:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 390 states have (on average 1.4153846153846155) internal successors, (552), 392 states have internal predecessors, (552), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 07:06:58,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 624 transitions. [2024-11-12 07:06:58,313 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 624 transitions. Word has length 144 [2024-11-12 07:06:58,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:06:58,313 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 624 transitions. [2024-11-12 07:06:58,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:06:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 624 transitions. [2024-11-12 07:06:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 07:06:58,316 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:06:58,316 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:06:58,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:06:58,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:06:58,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:06:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1557348177, now seen corresponding path program 1 times [2024-11-12 07:06:58,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:06:58,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568446821] [2024-11-12 07:06:58,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:06:58,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:06:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:06:58,387 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:06:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:06:58,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:06:58,474 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:06:58,475 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:06:58,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:06:58,478 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:06:58,549 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:06:58,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:06:58 BoogieIcfgContainer [2024-11-12 07:06:58,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:06:58,552 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:06:58,552 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:06:58,553 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:06:58,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:06:52" (3/4) ... [2024-11-12 07:06:58,555 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:06:58,556 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:06:58,556 INFO L158 Benchmark]: Toolchain (without parser) took 7265.03ms. Allocated memory was 174.1MB in the beginning and 306.2MB in the end (delta: 132.1MB). Free memory was 105.6MB in the beginning and 143.5MB in the end (delta: -37.9MB). Peak memory consumption was 95.9MB. Max. memory is 16.1GB. [2024-11-12 07:06:58,557 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:06:58,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.32ms. Allocated memory is still 174.1MB. Free memory was 105.3MB in the beginning and 88.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 07:06:58,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.89ms. Allocated memory is still 174.1MB. Free memory was 88.2MB in the beginning and 83.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:06:58,557 INFO L158 Benchmark]: Boogie Preprocessor took 80.21ms. Allocated memory is still 174.1MB. Free memory was 83.5MB in the beginning and 77.5MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 07:06:58,557 INFO L158 Benchmark]: RCFGBuilder took 916.17ms. Allocated memory is still 174.1MB. Free memory was 77.5MB in the beginning and 103.2MB in the end (delta: -25.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-12 07:06:58,558 INFO L158 Benchmark]: TraceAbstraction took 5894.98ms. Allocated memory was 174.1MB in the beginning and 306.2MB in the end (delta: 132.1MB). Free memory was 102.3MB in the beginning and 143.5MB in the end (delta: -41.2MB). Peak memory consumption was 93.7MB. Max. memory is 16.1GB. [2024-11-12 07:06:58,558 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 306.2MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:06:58,559 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.15ms. Allocated memory is still 121.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.32ms. Allocated memory is still 174.1MB. Free memory was 105.3MB in the beginning and 88.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.89ms. Allocated memory is still 174.1MB. Free memory was 88.2MB in the beginning and 83.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.21ms. Allocated memory is still 174.1MB. Free memory was 83.5MB in the beginning and 77.5MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 916.17ms. Allocated memory is still 174.1MB. Free memory was 77.5MB in the beginning and 103.2MB in the end (delta: -25.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5894.98ms. Allocated memory was 174.1MB in the beginning and 306.2MB in the end (delta: 132.1MB). Free memory was 102.3MB in the beginning and 143.5MB in the end (delta: -41.2MB). Peak memory consumption was 93.7MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 306.2MB. Free memory is still 143.5MB. 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 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L28-L30] float float_Array_0[1] = { 128.4 }; [L28-L30] float float_Array_0[1] = { 128.4 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 100 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 100 }; [L40] unsigned char last_1_unsigned_char_Array_0_1_ = 16; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L102] EXPR unsigned_char_Array_0[1] [L102] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L112] RET updateLastVariables() [L113] CALL updateVariables() [L73] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L74] 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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] 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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] 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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] 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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] double_Array_0[0] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[0] [L80] EXPR double_Array_0[0] >= 0.0F && 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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L80] EXPR double_Array_0[0] [L80] EXPR double_Array_0[0] >= 0.0F && 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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= 0.0F && 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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= 0.0F && 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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] double_Array_0[2] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[2] [L84] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L84] EXPR double_Array_0[2] [L84] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] double_Array_0[3] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[3] [L86] EXPR double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F [L86] EXPR double_Array_0[3] [L86] EXPR double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR (double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR (double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] RET assume_abort_if_not((double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] double_Array_0[4] = __VERIFIER_nondet_double() [L88] EXPR double_Array_0[4] [L88] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F [L88] EXPR double_Array_0[4] [L88] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] EXPR (double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] EXPR (double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] CALL assume_abort_if_not((double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] RET assume_abort_if_not((double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] double_Array_0[5] = __VERIFIER_nondet_double() [L90] EXPR double_Array_0[5] [L90] EXPR double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F [L90] EXPR double_Array_0[5] [L90] EXPR double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR (double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR (double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] CALL assume_abort_if_not((double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] RET assume_abort_if_not((double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L91] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L92] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L94] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L95] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L97] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L98] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L98] RET assume_abort_if_not(unsigned_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L99] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L113] RET updateVariables() [L114] CALL step() [L44] unsigned_long_int_Array_0[0] = last_1_unsigned_char_Array_0_1_ [L45] EXPR unsigned_long_int_Array_0[0] [L45] unsigned long int stepLocal_1 = unsigned_long_int_Array_0[0]; [L46] EXPR signed_short_int_Array_0[0] [L46] signed short int stepLocal_0 = signed_short_int_Array_0[0]; [L47] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L47] COND FALSE !(stepLocal_0 >= signed_short_int_Array_0[1]) [L54] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L57] EXPR double_Array_0[1] [L57] EXPR double_Array_0[0] [L57] EXPR double_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L57] COND FALSE !((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) [L60] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L60] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L65] EXPR unsigned_char_Array_0[1] [L65] signed_short_int_Array_0[2] = unsigned_char_Array_0[1] [L68] EXPR double_Array_0[1] [L68] EXPR double_Array_0[0] [L68] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] COND FALSE !(double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) [L114] RET step() [L115] CALL, EXPR property() [L105] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1 [L105] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])))) [L105] EXPR double_Array_0[1] [L105] EXPR double_Array_0[0] [L105] EXPR double_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))) [L105] EXPR signed_short_int_Array_0[2] [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR ((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1)) && ((signed_short_int_Array_0[0] >= signed_short_int_Array_0[1]) ? (((signed_short_int_Array_0[0] + last_1_unsigned_char_Array_0_1_) >= unsigned_long_int_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1)) && ((signed_short_int_Array_0[0] >= signed_short_int_Array_0[1]) ? (((signed_short_int_Array_0[0] + last_1_unsigned_char_Array_0_1_) >= unsigned_long_int_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105-L106] return ((((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1)) && ((signed_short_int_Array_0[0] >= signed_short_int_Array_0[1]) ? (((signed_short_int_Array_0[0] + last_1_unsigned_char_Array_0_1_) >= unsigned_long_int_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_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, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 799 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 797 mSDsluCounter, 6339 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4706 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 500 IncrementalHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1633 mSDtfsCounter, 500 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=639occurred in iteration=6, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 438 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1140 NumberOfCodeBlocks, 1140 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 989 ConstructedInterpolants, 0 QuantifiedInterpolants, 1862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3360/3360 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-12 07:06:58,591 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-17.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 cf9505dc2ef67c73c85afca644466d8e73c9d84bcc3bdb502bf9c06807a1f2ea --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:07:01,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:07:01,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:07:01,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:07:01,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:07:01,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:07:01,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:07:01,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:07:01,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:07:01,550 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:07:01,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:07:01,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:07:01,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:07:01,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:07:01,553 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:07:01,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:07:01,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:07:01,554 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:07:01,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:07:01,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:07:01,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:07:01,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:07:01,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:07:01,558 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:07:01,558 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:07:01,558 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:07:01,559 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:07:01,559 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:07:01,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:07:01,559 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:07:01,559 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:07:01,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:07:01,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:07:01,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:07:01,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:07:01,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:07:01,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:07:01,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:07:01,561 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:07:01,561 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:07:01,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:07:01,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:07:01,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:07:01,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:07:01,563 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 -> cf9505dc2ef67c73c85afca644466d8e73c9d84bcc3bdb502bf9c06807a1f2ea [2024-11-12 07:07:01,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:07:01,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:07:01,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:07:01,921 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:07:01,921 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:07:01,922 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-17.i [2024-11-12 07:07:03,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:07:03,765 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:07:03,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i [2024-11-12 07:07:03,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abfccc454/9c7ed7d2dd1d475fa63875c910055153/FLAGe86672c2d [2024-11-12 07:07:03,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abfccc454/9c7ed7d2dd1d475fa63875c910055153 [2024-11-12 07:07:03,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:07:03,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:07:03,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:07:03,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:07:03,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:07:03,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:07:03" (1/1) ... [2024-11-12 07:07:03,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ecaad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:03, skipping insertion in model container [2024-11-12 07:07:03,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:07:03" (1/1) ... [2024-11-12 07:07:03,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:07:04,046 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-17.i[916,929] [2024-11-12 07:07:04,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:07:04,154 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:07:04,167 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-17.i[916,929] [2024-11-12 07:07:04,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:07:04,250 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:07:04,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:04 WrapperNode [2024-11-12 07:07:04,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:07:04,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:07:04,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:07:04,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:07:04,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:04" (1/1) ... [2024-11-12 07:07:04,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:04" (1/1) ... [2024-11-12 07:07:04,308 INFO L138 Inliner]: procedures = 39, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 624 [2024-11-12 07:07:04,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:07:04,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:07:04,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:07:04,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:07:04,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:04" (1/1) ... [2024-11-12 07:07:04,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:04" (1/1) ... [2024-11-12 07:07:04,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:04" (1/1) ... [2024-11-12 07:07:04,347 INFO L175 MemorySlicer]: Split 156 memory accesses to 7 slices as follows [2, 14, 89, 3, 21, 22, 5]. 57 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 7, 1, 3, 2, 1]. The 19 writes are split as follows [0, 2, 7, 1, 5, 3, 1]. [2024-11-12 07:07:04,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:04" (1/1) ... [2024-11-12 07:07:04,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:04" (1/1) ... [2024-11-12 07:07:04,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:04" (1/1) ... [2024-11-12 07:07:04,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:04" (1/1) ... [2024-11-12 07:07:04,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:04" (1/1) ... [2024-11-12 07:07:04,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:04" (1/1) ... [2024-11-12 07:07:04,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:07:04,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:07:04,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:07:04,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:07:04,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:04" (1/1) ... [2024-11-12 07:07:04,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:07:04,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:07:04,432 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-12 07:07:04,436 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-12 07:07:04,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:07:04,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-12 07:07:04,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-12 07:07:04,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-12 07:07:04,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-12 07:07:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-12 07:07:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-12 07:07:04,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-12 07:07:04,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-12 07:07:04,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-12 07:07:04,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-12 07:07:04,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-12 07:07:04,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-12 07:07:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-12 07:07:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-12 07:07:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:07:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:07:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 07:07:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-12 07:07:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-12 07:07:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-12 07:07:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-12 07:07:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-12 07:07:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-12 07:07:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-12 07:07:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-12 07:07:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-12 07:07:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-12 07:07:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-12 07:07:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:07:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:07:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 07:07:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-12 07:07:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-12 07:07:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-12 07:07:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-12 07:07:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-12 07:07:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-12 07:07:04,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-12 07:07:04,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-12 07:07:04,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-12 07:07:04,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-12 07:07:04,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-12 07:07:04,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:07:04,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:07:04,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-12 07:07:04,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-12 07:07:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-12 07:07:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-12 07:07:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-12 07:07:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-12 07:07:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-12 07:07:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-12 07:07:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-12 07:07:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-12 07:07:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-12 07:07:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-12 07:07:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:07:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:07:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-12 07:07:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-12 07:07:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-12 07:07:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-12 07:07:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-12 07:07:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-12 07:07:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-12 07:07:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-12 07:07:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-12 07:07:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-12 07:07:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-12 07:07:04,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-12 07:07:04,502 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:07:04,502 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:07:04,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:07:04,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:07:04,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:07:04,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:07:04,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-12 07:07:04,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-12 07:07:04,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-12 07:07:04,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-12 07:07:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-12 07:07:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:07:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:07:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-12 07:07:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-12 07:07:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-12 07:07:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-12 07:07:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-12 07:07:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:07:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:07:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-12 07:07:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-12 07:07:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-12 07:07:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-12 07:07:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-12 07:07:04,734 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:07:04,736 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:07:07,878 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2024-11-12 07:07:07,878 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:07:07,908 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:07:07,908 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:07:07,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:07:07 BoogieIcfgContainer [2024-11-12 07:07:07,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:07:07,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:07:07,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:07:07,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:07:07,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:07:03" (1/3) ... [2024-11-12 07:07:07,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfe7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:07:07, skipping insertion in model container [2024-11-12 07:07:07,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:07:04" (2/3) ... [2024-11-12 07:07:07,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfe7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:07:07, skipping insertion in model container [2024-11-12 07:07:07,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:07:07" (3/3) ... [2024-11-12 07:07:07,926 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-17.i [2024-11-12 07:07:07,963 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:07:07,967 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:07:08,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:07:08,123 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;@36ada2ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:07:08,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:07:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:07:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-12 07:07:08,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:08,161 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:07:08,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:08,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:08,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1809069754, now seen corresponding path program 1 times [2024-11-12 07:07:08,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:07:08,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139092092] [2024-11-12 07:07:08,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:08,180 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-12 07:07:08,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:07:08,184 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-12 07:07:08,208 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-12 07:07:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:08,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:07:08,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:07:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-12 07:07:08,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:07:08,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:07:08,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139092092] [2024-11-12 07:07:08,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139092092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:07:08,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:07:08,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:07:08,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873929513] [2024-11-12 07:07:08,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:08,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:07:08,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:07:08,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:07:08,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:07:08,873 INFO L87 Difference]: Start difference. First operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:07:08,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:08,916 INFO L93 Difference]: Finished difference Result 281 states and 438 transitions. [2024-11-12 07:07:08,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:07:08,918 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-12 07:07:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:08,925 INFO L225 Difference]: With dead ends: 281 [2024-11-12 07:07:08,926 INFO L226 Difference]: Without dead ends: 140 [2024-11-12 07:07:08,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-12 07:07:08,932 INFO L435 NwaCegarLoop]: 207 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, 207 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-12 07:07:08,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:07:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-12 07:07:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-12 07:07:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:07:08,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2024-11-12 07:07:08,973 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 141 [2024-11-12 07:07:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:08,973 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2024-11-12 07:07:08,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:07:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2024-11-12 07:07:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-12 07:07:08,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:08,977 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:07:08,993 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 (2)] Forceful destruction successful, exit code 0 [2024-11-12 07:07:09,181 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-12 07:07:09,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:09,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash 676775910, now seen corresponding path program 1 times [2024-11-12 07:07:09,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:07:09,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096367023] [2024-11-12 07:07:09,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:09,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:07:09,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:07:09,190 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-12 07:07:09,193 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-12 07:07:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:09,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:07:09,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:07:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-12 07:07:09,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:07:09,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:07:09,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096367023] [2024-11-12 07:07:09,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096367023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:07:09,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:07:09,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:07:09,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710737904] [2024-11-12 07:07:09,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:09,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:07:09,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:07:09,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:07:09,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:07:09,876 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:07:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:09,995 INFO L93 Difference]: Finished difference Result 279 states and 414 transitions. [2024-11-12 07:07:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:07:09,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-12 07:07:09,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:09,998 INFO L225 Difference]: With dead ends: 279 [2024-11-12 07:07:09,998 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 07:07:09,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 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-12 07:07:10,000 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:10,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:07:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 07:07:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-12 07:07:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:07:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2024-11-12 07:07:10,019 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 141 [2024-11-12 07:07:10,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:10,025 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2024-11-12 07:07:10,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:07:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2024-11-12 07:07:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-12 07:07:10,028 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:10,028 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:07:10,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 07:07:10,229 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-12 07:07:10,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:10,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:10,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1999216472, now seen corresponding path program 1 times [2024-11-12 07:07:10,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:07:10,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729685082] [2024-11-12 07:07:10,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:10,232 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-12 07:07:10,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:07:10,235 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-12 07:07:10,236 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-12 07:07:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:10,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:07:10,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:07:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:07:10,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:07:10,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:07:10,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729685082] [2024-11-12 07:07:10,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729685082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:07:10,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:07:10,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:07:10,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743536684] [2024-11-12 07:07:10,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:10,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:07:10,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:07:10,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:07:10,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:07:10,720 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:07:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:10,860 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2024-11-12 07:07:10,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:07:10,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2024-11-12 07:07:10,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:10,862 INFO L225 Difference]: With dead ends: 283 [2024-11-12 07:07:10,862 INFO L226 Difference]: Without dead ends: 144 [2024-11-12 07:07:10,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 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-12 07:07:10,864 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:10,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:07:10,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-12 07:07:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-12 07:07:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:07:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-11-12 07:07:10,872 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 141 [2024-11-12 07:07:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:10,872 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-11-12 07:07:10,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:07:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-11-12 07:07:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 07:07:10,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:10,874 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:07:10,891 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-12 07:07:11,074 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-12 07:07:11,076 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:11,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash 551308611, now seen corresponding path program 1 times [2024-11-12 07:07:11,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:07:11,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658686393] [2024-11-12 07:07:11,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:11,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-12 07:07:11,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:07:11,079 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-12 07:07:11,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 (5)] Waiting until timeout for monitored process [2024-11-12 07:07:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:11,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:07:11,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:07:11,794 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 21 treesize of output 9 [2024-11-12 07:07:12,078 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-12 07:07:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:07:12,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:07:12,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:07:12,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658686393] [2024-11-12 07:07:12,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658686393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:07:12,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:07:12,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:07:12,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247603544] [2024-11-12 07:07:12,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:12,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:07:12,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:07:12,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:07:12,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:07:12,210 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:07:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:13,009 INFO L93 Difference]: Finished difference Result 570 states and 838 transitions. [2024-11-12 07:07:13,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:07:13,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-12 07:07:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:13,015 INFO L225 Difference]: With dead ends: 570 [2024-11-12 07:07:13,015 INFO L226 Difference]: Without dead ends: 429 [2024-11-12 07:07:13,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:07:13,020 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 448 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:13,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1398 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:07:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-12 07:07:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 326. [2024-11-12 07:07:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 291 states have (on average 1.4329896907216495) internal successors, (417), 291 states have internal predecessors, (417), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 07:07:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 481 transitions. [2024-11-12 07:07:13,042 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 481 transitions. Word has length 143 [2024-11-12 07:07:13,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:13,042 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 481 transitions. [2024-11-12 07:07:13,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:07:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 481 transitions. [2024-11-12 07:07:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 07:07:13,044 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:13,044 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:07:13,063 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-12 07:07:13,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:07:13,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:13,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:13,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1231366981, now seen corresponding path program 1 times [2024-11-12 07:07:13,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:07:13,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552754947] [2024-11-12 07:07:13,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:13,248 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-12 07:07:13,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:07:13,254 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:07:13,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 07:07:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:13,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:07:13,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:07:13,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:07:13,914 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 155 treesize of output 65 [2024-11-12 07:07:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-12 07:07:13,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:07:13,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:07:13,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552754947] [2024-11-12 07:07:13,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552754947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:07:13,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:07:13,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:07:13,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093231446] [2024-11-12 07:07:13,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:13,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:07:13,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:07:13,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:07:13,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:07:13,943 INFO L87 Difference]: Start difference. First operand 326 states and 481 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:07:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:17,732 INFO L93 Difference]: Finished difference Result 651 states and 961 transitions. [2024-11-12 07:07:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:07:17,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2024-11-12 07:07:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:17,740 INFO L225 Difference]: With dead ends: 651 [2024-11-12 07:07:17,740 INFO L226 Difference]: Without dead ends: 328 [2024-11-12 07:07:17,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:07:17,741 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 187 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:17,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 530 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-12 07:07:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-12 07:07:17,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2024-11-12 07:07:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 291 states have (on average 1.4261168384879725) internal successors, (415), 291 states have internal predecessors, (415), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 07:07:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 479 transitions. [2024-11-12 07:07:17,771 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 479 transitions. Word has length 143 [2024-11-12 07:07:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:17,774 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 479 transitions. [2024-11-12 07:07:17,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:07:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 479 transitions. [2024-11-12 07:07:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 07:07:17,775 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:17,775 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:07:17,796 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 (6)] Forceful destruction successful, exit code 0 [2024-11-12 07:07:17,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:07:17,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:17,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:17,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1428991807, now seen corresponding path program 1 times [2024-11-12 07:07:17,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:07:17,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838638850] [2024-11-12 07:07:17,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:17,978 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-12 07:07:17,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:07:17,980 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-12 07:07:17,981 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-12 07:07:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:18,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 07:07:18,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:07:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-12 07:07:18,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:07:18,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:07:18,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838638850] [2024-11-12 07:07:18,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838638850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:07:18,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:07:18,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:07:18,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144504914] [2024-11-12 07:07:18,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:18,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:07:18,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:07:18,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:07:18,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:07:18,567 INFO L87 Difference]: Start difference. First operand 326 states and 479 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-12 07:07:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:18,732 INFO L93 Difference]: Finished difference Result 657 states and 965 transitions. [2024-11-12 07:07:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:07:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 145 [2024-11-12 07:07:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:18,734 INFO L225 Difference]: With dead ends: 657 [2024-11-12 07:07:18,735 INFO L226 Difference]: Without dead ends: 330 [2024-11-12 07:07:18,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:07:18,737 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 1 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:18,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 891 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:07:18,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-12 07:07:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 326. [2024-11-12 07:07:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 291 states have (on average 1.4192439862542956) internal successors, (413), 291 states have internal predecessors, (413), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 07:07:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 477 transitions. [2024-11-12 07:07:18,754 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 477 transitions. Word has length 145 [2024-11-12 07:07:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:18,754 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 477 transitions. [2024-11-12 07:07:18,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-12 07:07:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 477 transitions. [2024-11-12 07:07:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 07:07:18,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:18,756 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:07:18,772 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 (7)] Ended with exit code 0 [2024-11-12 07:07:18,957 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-12 07:07:18,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:18,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:18,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1138830527, now seen corresponding path program 1 times [2024-11-12 07:07:18,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:07:18,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739183548] [2024-11-12 07:07:18,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:18,958 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-12 07:07:18,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:07:18,963 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-12 07:07:18,964 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-12 07:07:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:19,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:07:19,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:07:19,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:07:19,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-12 07:07:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-12 07:07:19,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:07:19,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:07:19,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739183548] [2024-11-12 07:07:19,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739183548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:07:19,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:07:19,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:07:19,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768730285] [2024-11-12 07:07:19,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:19,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:07:19,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:07:19,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:07:19,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:07:19,690 INFO L87 Difference]: Start difference. First operand 326 states and 477 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:07:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:24,149 INFO L93 Difference]: Finished difference Result 651 states and 953 transitions. [2024-11-12 07:07:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:07:24,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-11-12 07:07:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:24,152 INFO L225 Difference]: With dead ends: 651 [2024-11-12 07:07:24,152 INFO L226 Difference]: Without dead ends: 328 [2024-11-12 07:07:24,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:07:24,153 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 176 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:24,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 522 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-12 07:07:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-12 07:07:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2024-11-12 07:07:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 291 states have (on average 1.4123711340206186) internal successors, (411), 291 states have internal predecessors, (411), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 07:07:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 475 transitions. [2024-11-12 07:07:24,185 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 475 transitions. Word has length 145 [2024-11-12 07:07:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:24,186 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 475 transitions. [2024-11-12 07:07:24,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:07:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 475 transitions. [2024-11-12 07:07:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-12 07:07:24,187 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:24,187 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:07:24,217 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-12 07:07:24,387 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-12 07:07:24,388 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:24,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:24,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1245211387, now seen corresponding path program 1 times [2024-11-12 07:07:24,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:07:24,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574621036] [2024-11-12 07:07:24,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:24,389 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-12 07:07:24,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:07:24,392 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-12 07:07:24,393 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-12 07:07:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:24,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:07:24,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:07:25,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:07:25,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-12 07:07:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-12 07:07:25,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:07:25,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:07:25,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574621036] [2024-11-12 07:07:25,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574621036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:07:25,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:07:25,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:07:25,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438100912] [2024-11-12 07:07:25,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:25,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:07:25,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:07:25,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:07:25,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:07:25,081 INFO L87 Difference]: Start difference. First operand 326 states and 475 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:07:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:29,138 INFO L93 Difference]: Finished difference Result 649 states and 947 transitions. [2024-11-12 07:07:29,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:07:29,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2024-11-12 07:07:29,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:29,140 INFO L225 Difference]: With dead ends: 649 [2024-11-12 07:07:29,141 INFO L226 Difference]: Without dead ends: 326 [2024-11-12 07:07:29,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:07:29,142 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 168 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:29,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 518 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-12 07:07:29,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-12 07:07:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 322. [2024-11-12 07:07:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 287 states have (on average 1.411149825783972) internal successors, (405), 287 states have internal predecessors, (405), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 07:07:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 469 transitions. [2024-11-12 07:07:29,153 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 469 transitions. Word has length 147 [2024-11-12 07:07:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:29,153 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 469 transitions. [2024-11-12 07:07:29,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:07:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 469 transitions. [2024-11-12 07:07:29,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-12 07:07:29,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:29,154 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:07:29,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-12 07:07:29,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:07:29,356 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:29,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:29,356 INFO L85 PathProgramCache]: Analyzing trace with hash -947172163, now seen corresponding path program 1 times [2024-11-12 07:07:29,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:07:29,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069191653] [2024-11-12 07:07:29,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:29,357 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-12 07:07:29,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:07:29,360 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:07:29,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 07:07:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:29,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:07:29,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:07:30,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:07:30,129 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 172 treesize of output 64 [2024-11-12 07:07:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 252 proven. 24 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-12 07:07:30,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:07:30,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:07:30,545 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 110 treesize of output 1 [2024-11-12 07:07:30,578 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-12 07:07:30,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:07:30,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069191653] [2024-11-12 07:07:30,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069191653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:07:30,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:07:30,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-12 07:07:30,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532241220] [2024-11-12 07:07:30,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:07:30,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:07:30,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:07:30,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:07:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:07:30,580 INFO L87 Difference]: Start difference. First operand 322 states and 469 transitions. Second operand has 12 states, 11 states have (on average 9.818181818181818) internal successors, (108), 12 states have internal predecessors, (108), 4 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) [2024-11-12 07:07:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:36,192 INFO L93 Difference]: Finished difference Result 667 states and 965 transitions. [2024-11-12 07:07:36,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:07:36,193 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.818181818181818) internal successors, (108), 12 states have internal predecessors, (108), 4 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) Word has length 149 [2024-11-12 07:07:36,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:36,195 INFO L225 Difference]: With dead ends: 667 [2024-11-12 07:07:36,195 INFO L226 Difference]: Without dead ends: 326 [2024-11-12 07:07:36,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:07:36,196 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 170 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:36,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 668 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-12 07:07:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-12 07:07:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 322. [2024-11-12 07:07:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 287 states have (on average 1.397212543554007) internal successors, (401), 287 states have internal predecessors, (401), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 07:07:36,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 465 transitions. [2024-11-12 07:07:36,205 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 465 transitions. Word has length 149 [2024-11-12 07:07:36,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:36,205 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 465 transitions. [2024-11-12 07:07:36,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.818181818181818) internal successors, (108), 12 states have internal predecessors, (108), 4 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) [2024-11-12 07:07:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 465 transitions. [2024-11-12 07:07:36,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-12 07:07:36,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:36,207 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:07:36,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-12 07:07:36,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:07:36,407 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:36,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:36,408 INFO L85 PathProgramCache]: Analyzing trace with hash 959231103, now seen corresponding path program 1 times [2024-11-12 07:07:36,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:07:36,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124043046] [2024-11-12 07:07:36,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:36,409 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-12 07:07:36,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:07:36,412 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:07:36,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 07:07:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:37,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 07:07:37,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:07:37,134 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 35 treesize of output 31 [2024-11-12 07:07:37,180 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 108 treesize of output 90 [2024-11-12 07:07:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:07:37,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:07:37,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:07:37,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124043046] [2024-11-12 07:07:37,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124043046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:07:37,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:07:37,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:07:37,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337059690] [2024-11-12 07:07:37,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:37,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:07:37,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:07:37,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:07:37,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:07:37,214 INFO L87 Difference]: Start difference. First operand 322 states and 465 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:07:38,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:38,268 INFO L93 Difference]: Finished difference Result 969 states and 1401 transitions. [2024-11-12 07:07:38,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:07:38,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 149 [2024-11-12 07:07:38,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:38,273 INFO L225 Difference]: With dead ends: 969 [2024-11-12 07:07:38,273 INFO L226 Difference]: Without dead ends: 650 [2024-11-12 07:07:38,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:07:38,276 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 187 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:38,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1324 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 07:07:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-12 07:07:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2024-11-12 07:07:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 579 states have (on average 1.3937823834196892) internal successors, (807), 579 states have internal predecessors, (807), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-12 07:07:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 935 transitions. [2024-11-12 07:07:38,334 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 935 transitions. Word has length 149 [2024-11-12 07:07:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:38,335 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 935 transitions. [2024-11-12 07:07:38,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:07:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 935 transitions. [2024-11-12 07:07:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-12 07:07:38,336 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:38,337 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:07:38,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-12 07:07:38,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:07:38,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:38,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:38,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2006057727, now seen corresponding path program 1 times [2024-11-12 07:07:38,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:07:38,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309990456] [2024-11-12 07:07:38,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:38,540 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-12 07:07:38,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:07:38,542 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:07:38,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 07:07:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:07:39,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:07:39,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:07:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-11-12 07:07:39,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:07:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:07:39,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:07:39,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309990456] [2024-11-12 07:07:39,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309990456] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:07:39,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:07:39,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-12 07:07:39,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685640778] [2024-11-12 07:07:39,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:07:39,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:07:39,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:07:39,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:07:39,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:07:39,759 INFO L87 Difference]: Start difference. First operand 648 states and 935 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:07:40,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:07:40,584 INFO L93 Difference]: Finished difference Result 1646 states and 2371 transitions. [2024-11-12 07:07:40,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:07:40,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 149 [2024-11-12 07:07:40,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:07:40,589 INFO L225 Difference]: With dead ends: 1646 [2024-11-12 07:07:40,589 INFO L226 Difference]: Without dead ends: 1001 [2024-11-12 07:07:40,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:07:40,590 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 184 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:07:40,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 562 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:07:40,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-12 07:07:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 995. [2024-11-12 07:07:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 914 states have (on average 1.4048140043763677) internal successors, (1284), 918 states have internal predecessors, (1284), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-12 07:07:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1428 transitions. [2024-11-12 07:07:40,621 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1428 transitions. Word has length 149 [2024-11-12 07:07:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:07:40,621 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1428 transitions. [2024-11-12 07:07:40,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:07:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1428 transitions. [2024-11-12 07:07:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 07:07:40,623 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:07:40,623 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:07:40,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-12 07:07:40,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:07:40,824 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:07:40,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:07:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1711070551, now seen corresponding path program 1 times [2024-11-12 07:07:40,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:07:40,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947734534] [2024-11-12 07:07:40,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:07:40,825 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-12 07:07:40,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:07:40,828 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:07:40,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process