./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:49:28,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:49:28,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:49:28,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:49:28,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:49:28,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:49:28,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:49:28,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:49:28,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:49:28,673 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:49:28,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:49:28,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:49:28,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:49:28,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:49:28,675 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:49:28,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:49:28,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:49:28,677 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:49:28,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:49:28,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:49:28,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:49:28,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:49:28,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:49:28,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:49:28,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:49:28,679 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:49:28,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:49:28,679 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:49:28,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:49:28,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:49:28,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:49:28,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:49:28,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:49:28,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:49:28,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:49:28,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:49:28,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:49:28,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:49:28,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:49:28,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:49:28,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:49:28,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:49:28,683 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-clean/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-clean/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 -> fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f [2024-10-11 13:49:28,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:49:28,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:49:28,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:49:28,949 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:49:28,951 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:49:28,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i [2024-10-11 13:49:30,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:49:30,604 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:49:30,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i [2024-10-11 13:49:30,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5bcaad75c/6b1eff9f4d5e43a6a906be464be5c6f5/FLAG84aa41107 [2024-10-11 13:49:30,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5bcaad75c/6b1eff9f4d5e43a6a906be464be5c6f5 [2024-10-11 13:49:30,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:49:30,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:49:30,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:49:30,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:49:30,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:49:30,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:49:30" (1/1) ... [2024-10-11 13:49:30,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2309c12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:30, skipping insertion in model container [2024-10-11 13:49:30,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:49:30" (1/1) ... [2024-10-11 13:49:31,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:49:31,204 WARN L248 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-s_file-50.i[916,929] [2024-10-11 13:49:31,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:49:31,276 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:49:31,291 WARN L248 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-s_file-50.i[916,929] [2024-10-11 13:49:31,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:49:31,375 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:49:31,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:31 WrapperNode [2024-10-11 13:49:31,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:49:31,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:49:31,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:49:31,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:49:31,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:31" (1/1) ... [2024-10-11 13:49:31,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:31" (1/1) ... [2024-10-11 13:49:31,443 INFO L138 Inliner]: procedures = 29, calls = 208, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 592 [2024-10-11 13:49:31,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:49:31,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:49:31,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:49:31,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:49:31,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:31" (1/1) ... [2024-10-11 13:49:31,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:31" (1/1) ... [2024-10-11 13:49:31,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:31" (1/1) ... [2024-10-11 13:49:31,483 INFO L175 MemorySlicer]: Split 170 memory accesses to 2 slices as follows [2, 168]. 99 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 18]. The 23 writes are split as follows [0, 23]. [2024-10-11 13:49:31,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:31" (1/1) ... [2024-10-11 13:49:31,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:31" (1/1) ... [2024-10-11 13:49:31,503 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:31" (1/1) ... [2024-10-11 13:49:31,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:31" (1/1) ... [2024-10-11 13:49:31,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:31" (1/1) ... [2024-10-11 13:49:31,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:31" (1/1) ... [2024-10-11 13:49:31,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:49:31,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:49:31,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:49:31,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:49:31,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:31" (1/1) ... [2024-10-11 13:49:31,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:49:31,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:49:31,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:49:31,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:49:31,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:49:31,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:49:31,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:49:31,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:49:31,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:49:31,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:49:31,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:49:31,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:49:31,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:49:31,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:49:31,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:49:31,603 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:49:31,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:49:31,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:49:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:49:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:49:31,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:49:31,706 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:49:31,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:49:32,257 INFO L? ?]: Removed 152 outVars from TransFormulas that were not future-live. [2024-10-11 13:49:32,257 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:49:32,291 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:49:32,293 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:49:32,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:49:32 BoogieIcfgContainer [2024-10-11 13:49:32,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:49:32,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:49:32,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:49:32,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:49:32,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:49:30" (1/3) ... [2024-10-11 13:49:32,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@345f257e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:49:32, skipping insertion in model container [2024-10-11 13:49:32,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:31" (2/3) ... [2024-10-11 13:49:32,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@345f257e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:49:32, skipping insertion in model container [2024-10-11 13:49:32,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:49:32" (3/3) ... [2024-10-11 13:49:32,305 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-50.i [2024-10-11 13:49:32,322 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:49:32,322 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:49:32,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:49:32,390 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;@7e97d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:49:32,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:49:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:49:32,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 13:49:32,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:32,408 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:49:32,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:32,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:32,413 INFO L85 PathProgramCache]: Analyzing trace with hash -933651646, now seen corresponding path program 1 times [2024-10-11 13:49:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:49:32,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211735268] [2024-10-11 13:49:32,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:32,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:49:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:49:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:49:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:49:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:49:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:49:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:49:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:49:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:49:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:49:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:49:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:49:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:49:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:49:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:49:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:49:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:49:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:49:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:49:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:49:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:49:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:49:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:49:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:49:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:49:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 13:49:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 13:49:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:49:32,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:49:32,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211735268] [2024-10-11 13:49:32,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211735268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:32,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:32,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:49:32,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586043075] [2024-10-11 13:49:32,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:32,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:49:32,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:49:33,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:49:33,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:49:33,019 INFO L87 Difference]: Start difference. First operand has 123 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:49:33,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:33,062 INFO L93 Difference]: Finished difference Result 243 states and 394 transitions. [2024-10-11 13:49:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:49:33,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 190 [2024-10-11 13:49:33,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:33,072 INFO L225 Difference]: With dead ends: 243 [2024-10-11 13:49:33,073 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 13:49:33,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-10-11 13:49:33,078 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:33,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:49:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 13:49:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-11 13:49:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:49:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 180 transitions. [2024-10-11 13:49:33,127 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 180 transitions. Word has length 190 [2024-10-11 13:49:33,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:33,128 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 180 transitions. [2024-10-11 13:49:33,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:49:33,128 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 180 transitions. [2024-10-11 13:49:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 13:49:33,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:33,132 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:49:33,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:49:33,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:33,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:33,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1161754730, now seen corresponding path program 1 times [2024-10-11 13:49:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:49:33,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450588245] [2024-10-11 13:49:33,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:33,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:49:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:49:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:49:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:49:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:49:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:49:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:49:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:49:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:49:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:49:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:49:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:49:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:49:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:49:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:49:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:49:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:49:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:49:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:49:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:49:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:49:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:49:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:49:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:49:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:49:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 13:49:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 13:49:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:49:33,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:49:33,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450588245] [2024-10-11 13:49:33,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450588245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:33,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:33,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:49:33,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552671984] [2024-10-11 13:49:33,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:33,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:49:33,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:49:33,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:49:33,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:49:33,864 INFO L87 Difference]: Start difference. First operand 121 states and 180 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:49:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:34,351 INFO L93 Difference]: Finished difference Result 391 states and 582 transitions. [2024-10-11 13:49:34,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:49:34,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 190 [2024-10-11 13:49:34,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:34,359 INFO L225 Difference]: With dead ends: 391 [2024-10-11 13:49:34,359 INFO L226 Difference]: Without dead ends: 271 [2024-10-11 13:49:34,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:49:34,362 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 178 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:34,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 557 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:49:34,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-11 13:49:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 254. [2024-10-11 13:49:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.3869346733668342) internal successors, (276), 199 states have internal predecessors, (276), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:49:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2024-10-11 13:49:34,411 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 190 [2024-10-11 13:49:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:34,413 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2024-10-11 13:49:34,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:49:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2024-10-11 13:49:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 13:49:34,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:34,420 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:49:34,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:49:34,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:34,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:34,421 INFO L85 PathProgramCache]: Analyzing trace with hash 59765709, now seen corresponding path program 1 times [2024-10-11 13:49:34,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:49:34,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543634008] [2024-10-11 13:49:34,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:34,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:49:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:49:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:49:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:49:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:49:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:49:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:49:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:49:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:49:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:49:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:49:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:49:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:49:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:49:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:49:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:49:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:49:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:49:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:49:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:49:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:49:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:49:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:49:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:49:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:49:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 13:49:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 13:49:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:49:36,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:49:36,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543634008] [2024-10-11 13:49:36,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543634008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:36,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:36,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:49:36,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454099471] [2024-10-11 13:49:36,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:36,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:49:36,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:49:36,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:49:36,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:49:36,689 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:49:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:37,189 INFO L93 Difference]: Finished difference Result 659 states and 981 transitions. [2024-10-11 13:49:37,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:49:37,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 190 [2024-10-11 13:49:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:37,195 INFO L225 Difference]: With dead ends: 659 [2024-10-11 13:49:37,195 INFO L226 Difference]: Without dead ends: 406 [2024-10-11 13:49:37,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:49:37,197 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 93 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:37,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 819 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:49:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-11 13:49:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 402. [2024-10-11 13:49:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 329 states have (on average 1.3981762917933132) internal successors, (460), 331 states have internal predecessors, (460), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 13:49:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 596 transitions. [2024-10-11 13:49:37,275 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 596 transitions. Word has length 190 [2024-10-11 13:49:37,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:37,275 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 596 transitions. [2024-10-11 13:49:37,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:49:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 596 transitions. [2024-10-11 13:49:37,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-11 13:49:37,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:37,283 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:49:37,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:49:37,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:37,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1038626979, now seen corresponding path program 1 times [2024-10-11 13:49:37,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:49:37,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969098170] [2024-10-11 13:49:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:49:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:49:37,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:49:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:49:37,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:49:37,661 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:49:37,662 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:49:37,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:49:37,667 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 13:49:37,770 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:49:37,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:49:37 BoogieIcfgContainer [2024-10-11 13:49:37,774 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:49:37,775 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:49:37,775 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:49:37,775 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:49:37,775 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:49:32" (3/4) ... [2024-10-11 13:49:37,777 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:49:37,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:49:37,779 INFO L158 Benchmark]: Toolchain (without parser) took 6800.77ms. Allocated memory was 180.4MB in the beginning and 293.6MB in the end (delta: 113.2MB). Free memory was 112.3MB in the beginning and 210.0MB in the end (delta: -97.7MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-10-11 13:49:37,779 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:49:37,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.36ms. Allocated memory is still 180.4MB. Free memory was 112.0MB in the beginning and 142.0MB in the end (delta: -30.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-10-11 13:49:37,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.14ms. Allocated memory is still 180.4MB. Free memory was 142.0MB in the beginning and 137.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:49:37,784 INFO L158 Benchmark]: Boogie Preprocessor took 74.97ms. Allocated memory is still 180.4MB. Free memory was 137.2MB in the beginning and 132.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:49:37,785 INFO L158 Benchmark]: RCFGBuilder took 774.32ms. Allocated memory is still 180.4MB. Free memory was 132.4MB in the beginning and 93.2MB in the end (delta: 39.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-11 13:49:37,785 INFO L158 Benchmark]: TraceAbstraction took 5478.19ms. Allocated memory was 180.4MB in the beginning and 293.6MB in the end (delta: 113.2MB). Free memory was 91.8MB in the beginning and 210.0MB in the end (delta: -118.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:49:37,786 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 293.6MB. Free memory is still 210.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:49:37,787 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 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.36ms. Allocated memory is still 180.4MB. Free memory was 112.0MB in the beginning and 142.0MB in the end (delta: -30.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.14ms. Allocated memory is still 180.4MB. Free memory was 142.0MB in the beginning and 137.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.97ms. Allocated memory is still 180.4MB. Free memory was 137.2MB in the beginning and 132.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 774.32ms. Allocated memory is still 180.4MB. Free memory was 132.4MB in the beginning and 93.2MB in the end (delta: 39.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5478.19ms. Allocated memory was 180.4MB in the beginning and 293.6MB in the end (delta: 113.2MB). Free memory was 91.8MB in the beginning and 210.0MB in the end (delta: -118.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 293.6MB. Free memory is still 210.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryArithmeticDOUBLEoperation at line 144. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L63] signed long int last_1_WrapperStruct00_var_1_18 = -5; [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] CALL updateLastVariables() [L141] EXPR WrapperStruct00.var_1_18 [L141] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L151] RET updateLastVariables() [L152] CALL updateVariables() [L98] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_2 [L99] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L99] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_2 [L99] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L99] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L99] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L100] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_3 [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_3 [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L101] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L101] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L102] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_4 [L103] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L103] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_4 [L103] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L103] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L103] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L104] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L105] EXPR WrapperStruct00.var_1_5 [L105] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L105] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_5 [L105] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L105] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L105] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L106] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L109] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L111] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L112] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L114] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L115] WrapperStruct00.var_1_13 = __VERIFIER_nondet_short() [L116] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L117] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L118] WrapperStruct00.var_1_14 = __VERIFIER_nondet_short() [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L121] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L123] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L124] WrapperStruct00.var_1_16 = __VERIFIER_nondet_short() [L125] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L126] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L127] WrapperStruct00.var_1_17 = __VERIFIER_nondet_short() [L128] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L129] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L130] WrapperStruct00.var_1_19 = __VERIFIER_nondet_long() [L131] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L132] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L132] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L132] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L133] WrapperStruct00.var_1_20 = __VERIFIER_nondet_long() [L134] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L134] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L134] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L135] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L135] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L135] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 536870911) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L136] WrapperStruct00.var_1_21 = __VERIFIER_nondet_long() [L137] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L137] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L137] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L138] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L138] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 2147483646) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L138] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 2147483646) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L152] RET updateVariables() [L153] CALL step() [L67] signed long int stepLocal_1 = last_1_WrapperStruct00_var_1_18; VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_1=-5] [L68] COND FALSE !(stepLocal_1 >= 0) [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR WrapperStruct00.var_1_15 [L71] EXPR WrapperStruct00.var_1_16 [L71] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L71] EXPR ((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))) [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR ((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L71] WrapperStruct00.var_1_12 = ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))))) [L73] EXPR WrapperStruct00.var_1_15 [L73] EXPR WrapperStruct00.var_1_19 [L73] signed long int stepLocal_3 = WrapperStruct00.var_1_15 - WrapperStruct00.var_1_19; [L74] EXPR WrapperStruct00.var_1_12 [L74] signed short int stepLocal_2 = WrapperStruct00.var_1_12; [L75] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L75] COND FALSE !(WrapperStruct00.var_1_12 > stepLocal_3) [L80] EXPR WrapperStruct00.var_1_14 [L80] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_14 [L82] EXPR WrapperStruct00.var_1_12 [L82] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L82] EXPR ((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18) [L82] EXPR WrapperStruct00.var_1_12 [L82] EXPR ((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_2=8] [L82] signed long int stepLocal_0 = (((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18)); [L83] EXPR WrapperStruct00.var_1_2 [L83] EXPR WrapperStruct00.var_1_3 [L83] EXPR WrapperStruct00.var_1_4 [L83] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L83] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L83] EXPR WrapperStruct00.var_1_2 [L83] EXPR WrapperStruct00.var_1_3 [L83] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_0=8, stepLocal_2=8] [L83] COND TRUE (((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9 [L84] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L84] COND FALSE !(stepLocal_0 < WrapperStruct00.var_1_18) [L91] EXPR WrapperStruct00.var_1_10 [L91] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_10 [L153] RET step() [L154] CALL, EXPR property() [L144] EXPR WrapperStruct00.var_1_2 [L144] EXPR WrapperStruct00.var_1_3 [L144] EXPR WrapperStruct00.var_1_4 [L144] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L144] EXPR WrapperStruct00.var_1_2 [L144] EXPR WrapperStruct00.var_1_3 [L144] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR ((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11)) [L144] EXPR WrapperStruct00.var_1_1 [L144] EXPR WrapperStruct00.var_1_11 [L144] EXPR ((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR (((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11))) && ((last_1_WrapperStruct00_var_1_18 >= 0) ? (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR (((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11))) && ((last_1_WrapperStruct00_var_1_18 >= 0) ? (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR ((((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11))) && ((last_1_WrapperStruct00_var_1_18 >= 0) ? (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))))))))) && ((WrapperStruct00.var_1_12 > (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_19)) ? ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_18 == ((signed long int) ((WrapperStruct00.var_1_17 + (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_20)) - WrapperStruct00.var_1_21))) : 1) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR ((((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11))) && ((last_1_WrapperStruct00_var_1_18 >= 0) ? (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))))))))) && ((WrapperStruct00.var_1_12 > (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_19)) ? ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_18 == ((signed long int) ((WrapperStruct00.var_1_17 + (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_20)) - WrapperStruct00.var_1_21))) : 1) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144-L145] return ((((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11))) && ((last_1_WrapperStruct00_var_1_18 >= 0) ? (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))))))))) && ((WrapperStruct00.var_1_12 > (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_19)) ? ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_18 == ((signed long int) ((WrapperStruct00.var_1_17 + (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_20)) - WrapperStruct00.var_1_21))) : 1) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_14))) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 272 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 1552 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1026 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 641 IncrementalHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 526 mSDtfsCounter, 641 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=402occurred in iteration=3, InterpolantAutomatonStates: 13, 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, 3 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 761 NumberOfCodeBlocks, 761 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 567 ConstructedInterpolants, 0 QuantifiedInterpolants, 1067 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3900/3900 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-10-11 13:49:37,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:49:40,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:49:40,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:49:40,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:49:40,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:49:40,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:49:40,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:49:40,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:49:40,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:49:40,141 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:49:40,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:49:40,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:49:40,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:49:40,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:49:40,144 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:49:40,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:49:40,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:49:40,145 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:49:40,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:49:40,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:49:40,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:49:40,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:49:40,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:49:40,150 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:49:40,150 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:49:40,150 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:49:40,150 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:49:40,151 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:49:40,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:49:40,151 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:49:40,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:49:40,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:49:40,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:49:40,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:49:40,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:49:40,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:49:40,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:49:40,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:49:40,154 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:49:40,154 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:49:40,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:49:40,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:49:40,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:49:40,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:49:40,157 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:49:40,157 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-clean/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-clean/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 -> fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f [2024-10-11 13:49:40,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:49:40,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:49:40,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:49:40,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:49:40,493 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:49:40,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i [2024-10-11 13:49:42,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:49:42,228 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:49:42,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i [2024-10-11 13:49:42,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d1cc68bc8/793c5ada717b42678a0173ebe49001c4/FLAG98fa508aa [2024-10-11 13:49:42,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d1cc68bc8/793c5ada717b42678a0173ebe49001c4 [2024-10-11 13:49:42,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:49:42,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:49:42,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:49:42,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:49:42,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:49:42,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:49:42" (1/1) ... [2024-10-11 13:49:42,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7732d406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42, skipping insertion in model container [2024-10-11 13:49:42,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:49:42" (1/1) ... [2024-10-11 13:49:42,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:49:42,470 WARN L248 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-s_file-50.i[916,929] [2024-10-11 13:49:42,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:49:42,580 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:49:42,594 WARN L248 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-s_file-50.i[916,929] [2024-10-11 13:49:42,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:49:42,694 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:49:42,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42 WrapperNode [2024-10-11 13:49:42,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:49:42,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:49:42,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:49:42,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:49:42,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42" (1/1) ... [2024-10-11 13:49:42,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42" (1/1) ... [2024-10-11 13:49:42,788 INFO L138 Inliner]: procedures = 36, calls = 208, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 584 [2024-10-11 13:49:42,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:49:42,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:49:42,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:49:42,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:49:42,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42" (1/1) ... [2024-10-11 13:49:42,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42" (1/1) ... [2024-10-11 13:49:42,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42" (1/1) ... [2024-10-11 13:49:42,846 INFO L175 MemorySlicer]: Split 170 memory accesses to 2 slices as follows [2, 168]. 99 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 18]. The 23 writes are split as follows [0, 23]. [2024-10-11 13:49:42,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42" (1/1) ... [2024-10-11 13:49:42,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42" (1/1) ... [2024-10-11 13:49:42,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42" (1/1) ... [2024-10-11 13:49:42,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42" (1/1) ... [2024-10-11 13:49:42,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42" (1/1) ... [2024-10-11 13:49:42,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42" (1/1) ... [2024-10-11 13:49:42,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:49:42,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:49:42,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:49:42,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:49:42,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42" (1/1) ... [2024-10-11 13:49:42,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:49:42,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:49:42,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:49:42,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:49:42,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:49:42,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:49:42,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:49:42,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:49:42,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:49:42,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:49:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:49:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:49:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:49:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:49:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:49:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:49:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:49:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:49:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:49:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:49:42,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:49:42,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:49:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:49:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:49:43,000 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:49:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:49:43,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:49:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:49:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:49:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:49:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:49:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:49:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:49:43,132 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:49:43,133 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:49:46,271 INFO L? ?]: Removed 162 outVars from TransFormulas that were not future-live. [2024-10-11 13:49:46,272 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:49:46,319 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:49:46,319 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:49:46,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:49:46 BoogieIcfgContainer [2024-10-11 13:49:46,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:49:46,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:49:46,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:49:46,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:49:46,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:49:42" (1/3) ... [2024-10-11 13:49:46,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cac6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:49:46, skipping insertion in model container [2024-10-11 13:49:46,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:49:42" (2/3) ... [2024-10-11 13:49:46,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cac6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:49:46, skipping insertion in model container [2024-10-11 13:49:46,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:49:46" (3/3) ... [2024-10-11 13:49:46,329 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-50.i [2024-10-11 13:49:46,344 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:49:46,344 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:49:46,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:49:46,416 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;@3d3bacfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:49:46,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:49:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:49:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 13:49:46,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:46,441 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:49:46,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:46,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:46,447 INFO L85 PathProgramCache]: Analyzing trace with hash -933651646, now seen corresponding path program 1 times [2024-10-11 13:49:46,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:46,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581414650] [2024-10-11 13:49:46,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:46,464 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-10-11 13:49:46,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:46,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 13:49:46,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:49:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:47,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:49:47,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-10-11 13:49:47,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:49:47,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:47,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581414650] [2024-10-11 13:49:47,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581414650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:47,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:47,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:49:47,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968026032] [2024-10-11 13:49:47,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:47,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:49:47,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:47,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:49:47,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:49:47,226 INFO L87 Difference]: Start difference. First operand has 123 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:49:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:47,300 INFO L93 Difference]: Finished difference Result 243 states and 394 transitions. [2024-10-11 13:49:47,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:49:47,311 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 190 [2024-10-11 13:49:47,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:47,322 INFO L225 Difference]: With dead ends: 243 [2024-10-11 13:49:47,322 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 13:49:47,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 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-10-11 13:49:47,331 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:47,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:49:47,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 13:49:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-11 13:49:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:49:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 180 transitions. [2024-10-11 13:49:47,393 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 180 transitions. Word has length 190 [2024-10-11 13:49:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:47,393 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 180 transitions. [2024-10-11 13:49:47,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:49:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 180 transitions. [2024-10-11 13:49:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 13:49:47,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:47,403 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:49:47,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:49:47,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 13:49:47,604 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:47,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:47,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1161754730, now seen corresponding path program 1 times [2024-10-11 13:49:47,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:47,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517533874] [2024-10-11 13:49:47,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:47,607 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-10-11 13:49:47,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:47,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 13:49:47,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:49:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:48,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:49:48,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:49:49,083 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:49:49,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:49,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517533874] [2024-10-11 13:49:49,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517533874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:49,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:49,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:49:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670315890] [2024-10-11 13:49:49,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:49,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:49:49,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:49,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:49:49,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:49:49,088 INFO L87 Difference]: Start difference. First operand 121 states and 180 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:49:50,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:49:52,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:49:53,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:49:54,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:49:55,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:49:57,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:49:58,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:00,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:50:00,780 INFO L93 Difference]: Finished difference Result 391 states and 582 transitions. [2024-10-11 13:50:00,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:50:00,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 190 [2024-10-11 13:50:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:50:00,788 INFO L225 Difference]: With dead ends: 391 [2024-10-11 13:50:00,788 INFO L226 Difference]: Without dead ends: 271 [2024-10-11 13:50:00,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:50:00,791 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 175 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:50:00,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 557 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2024-10-11 13:50:00,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-11 13:50:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 254. [2024-10-11 13:50:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.3869346733668342) internal successors, (276), 199 states have internal predecessors, (276), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:50:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2024-10-11 13:50:00,839 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 190 [2024-10-11 13:50:00,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:50:00,843 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2024-10-11 13:50:00,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:50:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2024-10-11 13:50:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 13:50:00,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:50:00,850 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:50:00,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:50:01,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 13:50:01,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:50:01,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:50:01,052 INFO L85 PathProgramCache]: Analyzing trace with hash 59765709, now seen corresponding path program 1 times [2024-10-11 13:50:01,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:50:01,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494126687] [2024-10-11 13:50:01,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:50:01,054 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-10-11 13:50:01,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:50:01,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 13:50:01,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:50:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:50:01,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:50:01,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:50:01,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:01,883 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-10-11 13:50:01,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2024-10-11 13:50:01,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:50:01,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:50:01,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494126687] [2024-10-11 13:50:01,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494126687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:50:01,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:50:01,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:50:01,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577764547] [2024-10-11 13:50:01,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:50:01,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:50:01,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:50:01,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:50:01,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:50:01,957 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:50:04,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:06,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:08,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:10,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:50:10,739 INFO L93 Difference]: Finished difference Result 509 states and 761 transitions. [2024-10-11 13:50:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:50:10,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 190 [2024-10-11 13:50:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:50:10,743 INFO L225 Difference]: With dead ends: 509 [2024-10-11 13:50:10,744 INFO L226 Difference]: Without dead ends: 256 [2024-10-11 13:50:10,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 185 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-10-11 13:50:10,746 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 162 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:50:10,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 487 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-10-11 13:50:10,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-11 13:50:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2024-10-11 13:50:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.3768844221105527) internal successors, (274), 199 states have internal predecessors, (274), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:50:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2024-10-11 13:50:10,783 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 190 [2024-10-11 13:50:10,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:50:10,784 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2024-10-11 13:50:10,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:50:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2024-10-11 13:50:10,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 13:50:10,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:50:10,787 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:50:10,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 13:50:10,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 13:50:10,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:50:10,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:50:10,988 INFO L85 PathProgramCache]: Analyzing trace with hash 502246535, now seen corresponding path program 1 times [2024-10-11 13:50:10,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:50:10,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139192353] [2024-10-11 13:50:10,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:50:10,990 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-10-11 13:50:10,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:50:10,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 13:50:10,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:50:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:50:11,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:50:11,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:50:11,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:11,892 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-10-11 13:50:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2024-10-11 13:50:11,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:50:11,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:50:11,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139192353] [2024-10-11 13:50:11,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139192353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:50:11,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:50:11,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:50:11,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036406037] [2024-10-11 13:50:11,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:50:11,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:50:11,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:50:11,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:50:11,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:50:11,955 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:50:14,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:15,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:17,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:50:17,796 INFO L93 Difference]: Finished difference Result 509 states and 757 transitions. [2024-10-11 13:50:17,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:50:17,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 192 [2024-10-11 13:50:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:50:17,799 INFO L225 Difference]: With dead ends: 509 [2024-10-11 13:50:17,799 INFO L226 Difference]: Without dead ends: 256 [2024-10-11 13:50:17,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:50:17,801 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 154 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:50:17,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 481 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-11 13:50:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-11 13:50:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2024-10-11 13:50:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.3668341708542713) internal successors, (272), 199 states have internal predecessors, (272), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:50:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2024-10-11 13:50:17,824 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 192 [2024-10-11 13:50:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:50:17,825 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2024-10-11 13:50:17,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:50:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2024-10-11 13:50:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 13:50:17,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:50:17,827 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:50:17,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:50:18,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-11 13:50:18,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:50:18,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:50:18,029 INFO L85 PathProgramCache]: Analyzing trace with hash 537116301, now seen corresponding path program 1 times [2024-10-11 13:50:18,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:50:18,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958445129] [2024-10-11 13:50:18,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:50:18,030 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-10-11 13:50:18,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:50:18,033 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-11 13:50:18,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:50:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:50:19,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 13:50:19,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:50:19,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:50:19,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-11 13:50:19,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:19,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-11 13:50:19,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:19,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-10-11 13:50:20,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:20,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-11 13:50:20,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:20,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-11 13:50:20,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:20,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-11 13:50:21,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:21,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-11 13:50:21,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:21,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-11 13:50:22,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:22,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-11 13:50:22,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:22,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 65 [2024-10-11 13:50:22,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:22,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 77 [2024-10-11 13:50:22,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:22,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 118 treesize of output 52 [2024-10-11 13:50:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 891 proven. 48 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-10-11 13:50:22,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:50:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:50:23,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:50:23,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958445129] [2024-10-11 13:50:23,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958445129] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:50:23,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:50:23,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 15 [2024-10-11 13:50:23,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348621127] [2024-10-11 13:50:23,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:50:23,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:50:23,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:50:23,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:50:23,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:50:23,074 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:50:24,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:26,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:27,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:29,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:31,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:32,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:50:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:50:32,955 INFO L93 Difference]: Finished difference Result 659 states and 969 transitions. [2024-10-11 13:50:32,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:50:32,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 194 [2024-10-11 13:50:32,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:50:32,959 INFO L225 Difference]: With dead ends: 659 [2024-10-11 13:50:32,959 INFO L226 Difference]: Without dead ends: 406 [2024-10-11 13:50:32,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:50:32,962 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 91 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:50:32,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 688 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2024-10-11 13:50:32,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-11 13:50:32,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 402. [2024-10-11 13:50:32,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 329 states have (on average 1.3738601823708207) internal successors, (452), 331 states have internal predecessors, (452), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 13:50:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 588 transitions. [2024-10-11 13:50:33,003 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 588 transitions. Word has length 194 [2024-10-11 13:50:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:50:33,004 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 588 transitions. [2024-10-11 13:50:33,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:50:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 588 transitions. [2024-10-11 13:50:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-11 13:50:33,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:50:33,009 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:50:33,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 13:50:33,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-11 13:50:33,210 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:50:33,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:50:33,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1343373853, now seen corresponding path program 1 times [2024-10-11 13:50:33,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:50:33,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669524099] [2024-10-11 13:50:33,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:50:33,211 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-10-11 13:50:33,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:50:33,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-11 13:50:33,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:50:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:50:34,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-11 13:50:34,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:50:34,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:50:34,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 69 [2024-10-11 13:50:35,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:35,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 255 treesize of output 141 [2024-10-11 13:50:41,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:41,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 285 treesize of output 147 [2024-10-11 13:50:45,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:45,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 269 treesize of output 157 [2024-10-11 13:50:47,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:47,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 279 treesize of output 170 [2024-10-11 13:50:48,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:48,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 294 treesize of output 173 [2024-10-11 13:50:49,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:49,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 289 treesize of output 183 [2024-10-11 13:50:50,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:50,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 304 treesize of output 186 [2024-10-11 13:50:51,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:51,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 299 treesize of output 196 [2024-10-11 13:50:52,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:52,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 314 treesize of output 199 [2024-10-11 13:50:53,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:53,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 314 treesize of output 199 [2024-10-11 13:50:55,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:55,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 314 treesize of output 199 [2024-10-11 13:50:56,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:50:56,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 314 treesize of output 199