./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-sp_file-55.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-sp_file-55.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 f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:01:00,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:01:00,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:01:00,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:01:00,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:01:00,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:01:00,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:01:00,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:01:00,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:01:00,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:01:00,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:01:00,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:01:00,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:01:00,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:01:00,450 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:01:00,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:01:00,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:01:00,450 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:01:00,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:01:00,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:01:00,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:01:00,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:01:00,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:01:00,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:01:00,452 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:01:00,452 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:01:00,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:01:00,452 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:01:00,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:01:00,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:01:00,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:01:00,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:01:00,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:01:00,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:01:00,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:01:00,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:01:00,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:01:00,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:01:00,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:01:00,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:01:00,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:01:00,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:01:00,456 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 -> f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da [2024-10-11 14:01:00,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:01:00,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:01:00,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:01:00,706 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:01:00,706 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:01:00,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.i [2024-10-11 14:01:01,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:01:02,053 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:01:02,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.i [2024-10-11 14:01:02,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6ae0db6d2/85adb5e6bbfd4b67a63d4cabdb5480ab/FLAGe18d69d7e [2024-10-11 14:01:02,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6ae0db6d2/85adb5e6bbfd4b67a63d4cabdb5480ab [2024-10-11 14:01:02,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:01:02,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:01:02,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:01:02,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:01:02,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:01:02,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:01:02" (1/1) ... [2024-10-11 14:01:02,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3026d595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02, skipping insertion in model container [2024-10-11 14:01:02,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:01:02" (1/1) ... [2024-10-11 14:01:02,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:01:02,262 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-sp_file-55.i[917,930] [2024-10-11 14:01:02,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:01:02,332 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:01:02,342 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-sp_file-55.i[917,930] [2024-10-11 14:01:02,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:01:02,394 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:01:02,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02 WrapperNode [2024-10-11 14:01:02,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:01:02,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:01:02,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:01:02,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:01:02,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02" (1/1) ... [2024-10-11 14:01:02,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02" (1/1) ... [2024-10-11 14:01:02,441 INFO L138 Inliner]: procedures = 29, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 455 [2024-10-11 14:01:02,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:01:02,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:01:02,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:01:02,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:01:02,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02" (1/1) ... [2024-10-11 14:01:02,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02" (1/1) ... [2024-10-11 14:01:02,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02" (1/1) ... [2024-10-11 14:01:02,475 INFO L175 MemorySlicer]: Split 108 memory accesses to 2 slices as follows [2, 106]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 17 writes are split as follows [0, 17]. [2024-10-11 14:01:02,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02" (1/1) ... [2024-10-11 14:01:02,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02" (1/1) ... [2024-10-11 14:01:02,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02" (1/1) ... [2024-10-11 14:01:02,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02" (1/1) ... [2024-10-11 14:01:02,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02" (1/1) ... [2024-10-11 14:01:02,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02" (1/1) ... [2024-10-11 14:01:02,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:01:02,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:01:02,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:01:02,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:01:02,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02" (1/1) ... [2024-10-11 14:01:02,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:01:02,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:01:02,529 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 14:01:02,532 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 14:01:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:01:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 14:01:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 14:01:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:01:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:01:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 14:01:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 14:01:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:01:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:01:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 14:01:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 14:01:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:01:02,574 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:01:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:01:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:01:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:01:02,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:01:02,670 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:01:02,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:01:03,081 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-10-11 14:01:03,081 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:01:03,110 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:01:03,110 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:01:03,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:01:03 BoogieIcfgContainer [2024-10-11 14:01:03,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:01:03,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:01:03,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:01:03,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:01:03,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:01:02" (1/3) ... [2024-10-11 14:01:03,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb53efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:01:03, skipping insertion in model container [2024-10-11 14:01:03,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:02" (2/3) ... [2024-10-11 14:01:03,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb53efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:01:03, skipping insertion in model container [2024-10-11 14:01:03,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:01:03" (3/3) ... [2024-10-11 14:01:03,117 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-55.i [2024-10-11 14:01:03,129 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:01:03,129 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:01:03,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:01:03,180 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;@4fa6be99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:01:03,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:01:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:03,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 14:01:03,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:03,196 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:03,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:03,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:03,202 INFO L85 PathProgramCache]: Analyzing trace with hash -521798446, now seen corresponding path program 1 times [2024-10-11 14:01:03,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:03,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432029063] [2024-10-11 14:01:03,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:03,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:03,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:03,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432029063] [2024-10-11 14:01:03,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432029063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:03,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:03,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:01:03,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756586021] [2024-10-11 14:01:03,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:03,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:01:03,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:03,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:01:03,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:01:03,542 INFO L87 Difference]: Start difference. First operand has 104 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:03,581 INFO L93 Difference]: Finished difference Result 205 states and 320 transitions. [2024-10-11 14:01:03,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:01:03,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-10-11 14:01:03,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:03,591 INFO L225 Difference]: With dead ends: 205 [2024-10-11 14:01:03,591 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 14:01:03,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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 14:01:03,598 INFO L432 NwaCegarLoop]: 146 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, 146 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 14:01:03,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 14:01:03,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-11 14:01:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2024-10-11 14:01:03,632 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 110 [2024-10-11 14:01:03,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:03,633 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2024-10-11 14:01:03,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2024-10-11 14:01:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 14:01:03,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:03,636 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:03,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:01:03,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:03,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1590369346, now seen corresponding path program 1 times [2024-10-11 14:01:03,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:03,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069631873] [2024-10-11 14:01:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:03,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:03,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:03,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069631873] [2024-10-11 14:01:03,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069631873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:03,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:03,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:03,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497400476] [2024-10-11 14:01:03,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:03,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:03,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:03,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:03,871 INFO L87 Difference]: Start difference. First operand 102 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:03,919 INFO L93 Difference]: Finished difference Result 205 states and 302 transitions. [2024-10-11 14:01:03,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:03,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-10-11 14:01:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:03,941 INFO L225 Difference]: With dead ends: 205 [2024-10-11 14:01:03,941 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 14:01:03,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:03,945 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:03,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 14:01:03,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 14:01:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:03,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-10-11 14:01:03,957 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 110 [2024-10-11 14:01:03,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:03,959 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-10-11 14:01:03,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-10-11 14:01:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 14:01:03,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:03,962 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:03,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:01:03,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:03,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:03,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1972630524, now seen corresponding path program 1 times [2024-10-11 14:01:03,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:03,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169722379] [2024-10-11 14:01:03,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,211 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:04,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:04,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169722379] [2024-10-11 14:01:04,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169722379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:04,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:04,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:04,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497187801] [2024-10-11 14:01:04,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:04,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:04,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:04,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:04,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:04,215 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:04,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:04,255 INFO L93 Difference]: Finished difference Result 210 states and 307 transitions. [2024-10-11 14:01:04,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:04,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-11 14:01:04,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:04,258 INFO L225 Difference]: With dead ends: 210 [2024-10-11 14:01:04,259 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 14:01:04,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:04,261 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:04,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 422 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 14:01:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-10-11 14:01:04,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-10-11 14:01:04,275 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 110 [2024-10-11 14:01:04,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:04,276 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-10-11 14:01:04,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:04,276 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-10-11 14:01:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 14:01:04,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:04,277 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:04,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:01:04,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:04,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:04,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1512990146, now seen corresponding path program 1 times [2024-10-11 14:01:04,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:04,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615467620] [2024-10-11 14:01:04,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:04,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:04,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615467620] [2024-10-11 14:01:04,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615467620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:04,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:04,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369377189] [2024-10-11 14:01:04,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:04,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:04,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:04,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:04,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:04,432 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:04,464 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2024-10-11 14:01:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:04,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-11 14:01:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:04,467 INFO L225 Difference]: With dead ends: 214 [2024-10-11 14:01:04,468 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 14:01:04,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:04,469 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:04,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 423 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 14:01:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-10-11 14:01:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-10-11 14:01:04,480 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 110 [2024-10-11 14:01:04,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:04,481 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-10-11 14:01:04,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:04,482 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-10-11 14:01:04,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 14:01:04,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:04,483 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:04,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:01:04,486 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:04,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:04,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1570248448, now seen corresponding path program 1 times [2024-10-11 14:01:04,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:04,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826005037] [2024-10-11 14:01:04,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:04,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:04,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:04,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826005037] [2024-10-11 14:01:04,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826005037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:04,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:04,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:04,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955464519] [2024-10-11 14:01:04,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:04,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:04,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:04,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:04,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:04,599 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:04,627 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2024-10-11 14:01:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:04,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-11 14:01:04,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:04,629 INFO L225 Difference]: With dead ends: 218 [2024-10-11 14:01:04,629 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 14:01:04,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:04,631 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:04,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 426 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:04,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 14:01:04,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-10-11 14:01:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-10-11 14:01:04,640 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 110 [2024-10-11 14:01:04,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:04,641 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-10-11 14:01:04,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-10-11 14:01:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 14:01:04,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:04,643 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:04,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:01:04,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:04,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:04,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1570308030, now seen corresponding path program 1 times [2024-10-11 14:01:04,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:04,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783407718] [2024-10-11 14:01:04,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:04,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:04,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:04,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783407718] [2024-10-11 14:01:04,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783407718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:04,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:04,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:01:04,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191828921] [2024-10-11 14:01:04,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:04,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:01:04,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:04,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:01:04,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:01:04,774 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:04,793 INFO L93 Difference]: Finished difference Result 219 states and 315 transitions. [2024-10-11 14:01:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:01:04,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-11 14:01:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:04,796 INFO L225 Difference]: With dead ends: 219 [2024-10-11 14:01:04,796 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 14:01:04,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:01:04,798 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:04,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 14:01:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-11 14:01:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 96 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 157 transitions. [2024-10-11 14:01:04,808 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 157 transitions. Word has length 110 [2024-10-11 14:01:04,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:04,808 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 157 transitions. [2024-10-11 14:01:04,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:04,809 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 157 transitions. [2024-10-11 14:01:04,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 14:01:04,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:04,810 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:04,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:01:04,811 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:04,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1803983619, now seen corresponding path program 1 times [2024-10-11 14:01:04,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:04,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597398838] [2024-10-11 14:01:04,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:04,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:05,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:05,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:05,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:05,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:05,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:05,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:05,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:05,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:05,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:05,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:05,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:05,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:05,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597398838] [2024-10-11 14:01:05,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597398838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:05,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:05,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:01:05,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883240358] [2024-10-11 14:01:05,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:05,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:01:05,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:05,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:01:05,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:01:05,979 INFO L87 Difference]: Start difference. First operand 110 states and 157 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:06,295 INFO L93 Difference]: Finished difference Result 272 states and 385 transitions. [2024-10-11 14:01:06,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:01:06,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-10-11 14:01:06,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:06,297 INFO L225 Difference]: With dead ends: 272 [2024-10-11 14:01:06,297 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 14:01:06,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:01:06,298 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 305 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:06,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 478 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:01:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 14:01:06,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 123. [2024-10-11 14:01:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 109 states have internal predecessors, (150), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2024-10-11 14:01:06,307 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 112 [2024-10-11 14:01:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:06,307 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2024-10-11 14:01:06,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2024-10-11 14:01:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 14:01:06,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:06,308 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:06,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:01:06,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:06,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:06,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1669970113, now seen corresponding path program 1 times [2024-10-11 14:01:06,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:06,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728102706] [2024-10-11 14:01:06,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:06,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:06,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:06,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:06,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:06,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:06,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:06,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:06,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:06,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:06,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:06,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:06,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728102706] [2024-10-11 14:01:06,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728102706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:06,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:06,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:01:06,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321040887] [2024-10-11 14:01:06,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:06,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:01:06,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:06,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:01:06,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:06,958 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:07,360 INFO L93 Difference]: Finished difference Result 426 states and 600 transitions. [2024-10-11 14:01:07,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:07,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-10-11 14:01:07,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:07,362 INFO L225 Difference]: With dead ends: 426 [2024-10-11 14:01:07,362 INFO L226 Difference]: Without dead ends: 304 [2024-10-11 14:01:07,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:01:07,363 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 208 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:07,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 558 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:01:07,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-11 14:01:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 182. [2024-10-11 14:01:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 155 states have (on average 1.3741935483870968) internal successors, (213), 155 states have internal predecessors, (213), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 14:01:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 261 transitions. [2024-10-11 14:01:07,384 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 261 transitions. Word has length 112 [2024-10-11 14:01:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:07,385 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 261 transitions. [2024-10-11 14:01:07,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 261 transitions. [2024-10-11 14:01:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 14:01:07,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:07,386 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:07,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:01:07,386 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:07,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:07,387 INFO L85 PathProgramCache]: Analyzing trace with hash 487028504, now seen corresponding path program 1 times [2024-10-11 14:01:07,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:07,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874838960] [2024-10-11 14:01:07,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:07,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:07,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:07,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:07,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:07,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:07,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:07,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:07,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:07,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:07,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:07,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:07,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:07,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:07,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:07,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874838960] [2024-10-11 14:01:07,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874838960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:07,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:07,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:01:07,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244948419] [2024-10-11 14:01:07,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:07,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:01:07,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:07,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:01:07,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:01:07,551 INFO L87 Difference]: Start difference. First operand 182 states and 261 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:07,722 INFO L93 Difference]: Finished difference Result 370 states and 523 transitions. [2024-10-11 14:01:07,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:01:07,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-10-11 14:01:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:07,724 INFO L225 Difference]: With dead ends: 370 [2024-10-11 14:01:07,724 INFO L226 Difference]: Without dead ends: 248 [2024-10-11 14:01:07,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:01:07,726 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 58 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:07,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 465 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:01:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-11 14:01:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 188. [2024-10-11 14:01:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 161 states have (on average 1.360248447204969) internal successors, (219), 161 states have internal predecessors, (219), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 14:01:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 267 transitions. [2024-10-11 14:01:07,752 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 267 transitions. Word has length 113 [2024-10-11 14:01:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:07,753 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 267 transitions. [2024-10-11 14:01:07,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 267 transitions. [2024-10-11 14:01:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 14:01:07,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:07,754 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:07,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:01:07,755 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:07,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:07,755 INFO L85 PathProgramCache]: Analyzing trace with hash 149976487, now seen corresponding path program 1 times [2024-10-11 14:01:07,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:07,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265166312] [2024-10-11 14:01:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:07,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:08,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:08,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265166312] [2024-10-11 14:01:08,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265166312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:08,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:08,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:01:08,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140437522] [2024-10-11 14:01:08,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:08,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:01:08,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:08,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:01:08,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:08,612 INFO L87 Difference]: Start difference. First operand 188 states and 267 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:01:08,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:08,910 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2024-10-11 14:01:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:08,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2024-10-11 14:01:08,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:08,912 INFO L225 Difference]: With dead ends: 425 [2024-10-11 14:01:08,912 INFO L226 Difference]: Without dead ends: 297 [2024-10-11 14:01:08,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:01:08,913 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 106 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:08,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 555 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:01:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-11 14:01:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2024-10-11 14:01:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 254 states have (on average 1.3622047244094488) internal successors, (346), 254 states have internal predecessors, (346), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:01:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 418 transitions. [2024-10-11 14:01:08,933 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 418 transitions. Word has length 114 [2024-10-11 14:01:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:08,934 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 418 transitions. [2024-10-11 14:01:08,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:01:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 418 transitions. [2024-10-11 14:01:08,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 14:01:08,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:08,935 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:08,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:01:08,935 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:08,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:08,935 INFO L85 PathProgramCache]: Analyzing trace with hash 551353342, now seen corresponding path program 1 times [2024-10-11 14:01:08,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:08,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612687436] [2024-10-11 14:01:08,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:08,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:09,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:09,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612687436] [2024-10-11 14:01:09,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612687436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:09,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:09,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:01:09,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424543172] [2024-10-11 14:01:09,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:09,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:01:09,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:09,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:01:09,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:01:09,640 INFO L87 Difference]: Start difference. First operand 294 states and 418 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:09,916 INFO L93 Difference]: Finished difference Result 486 states and 683 transitions. [2024-10-11 14:01:09,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:01:09,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-11 14:01:09,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:09,919 INFO L225 Difference]: With dead ends: 486 [2024-10-11 14:01:09,919 INFO L226 Difference]: Without dead ends: 358 [2024-10-11 14:01:09,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:01:09,920 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 181 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:09,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 616 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:01:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-11 14:01:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 318. [2024-10-11 14:01:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 278 states have (on average 1.356115107913669) internal successors, (377), 278 states have internal predecessors, (377), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:01:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 449 transitions. [2024-10-11 14:01:09,947 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 449 transitions. Word has length 114 [2024-10-11 14:01:09,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:09,948 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 449 transitions. [2024-10-11 14:01:09,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 449 transitions. [2024-10-11 14:01:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 14:01:09,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:09,949 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:09,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:01:09,949 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:09,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1281220432, now seen corresponding path program 1 times [2024-10-11 14:01:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:09,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758358600] [2024-10-11 14:01:09,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:09,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:10,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:10,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758358600] [2024-10-11 14:01:10,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758358600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:10,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:10,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:01:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968013179] [2024-10-11 14:01:10,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:10,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:01:10,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:10,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:01:10,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:01:10,067 INFO L87 Difference]: Start difference. First operand 318 states and 449 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:10,115 INFO L93 Difference]: Finished difference Result 578 states and 813 transitions. [2024-10-11 14:01:10,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:01:10,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-10-11 14:01:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:10,117 INFO L225 Difference]: With dead ends: 578 [2024-10-11 14:01:10,119 INFO L226 Difference]: Without dead ends: 324 [2024-10-11 14:01:10,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:01:10,120 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:10,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-11 14:01:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2024-10-11 14:01:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 282 states have (on average 1.351063829787234) internal successors, (381), 282 states have internal predecessors, (381), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:01:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 453 transitions. [2024-10-11 14:01:10,145 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 453 transitions. Word has length 115 [2024-10-11 14:01:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:10,146 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 453 transitions. [2024-10-11 14:01:10,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:10,146 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 453 transitions. [2024-10-11 14:01:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 14:01:10,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:10,147 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:10,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:01:10,147 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:10,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:10,147 INFO L85 PathProgramCache]: Analyzing trace with hash 126359396, now seen corresponding path program 1 times [2024-10-11 14:01:10,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:10,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283631878] [2024-10-11 14:01:10,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:10,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:10,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283631878] [2024-10-11 14:01:10,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283631878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:10,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:10,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:01:10,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80238823] [2024-10-11 14:01:10,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:10,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:01:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:10,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:01:10,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:10,341 INFO L87 Difference]: Start difference. First operand 322 states and 453 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:10,556 INFO L93 Difference]: Finished difference Result 726 states and 1007 transitions. [2024-10-11 14:01:10,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:01:10,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-11 14:01:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:10,558 INFO L225 Difference]: With dead ends: 726 [2024-10-11 14:01:10,559 INFO L226 Difference]: Without dead ends: 462 [2024-10-11 14:01:10,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:01:10,560 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 179 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:10,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 578 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:01:10,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-11 14:01:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 369. [2024-10-11 14:01:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 329 states have (on average 1.337386018237082) internal successors, (440), 329 states have internal predecessors, (440), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:01:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 512 transitions. [2024-10-11 14:01:10,590 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 512 transitions. Word has length 116 [2024-10-11 14:01:10,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:10,590 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 512 transitions. [2024-10-11 14:01:10,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:10,590 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 512 transitions. [2024-10-11 14:01:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 14:01:10,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:10,591 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:10,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 14:01:10,591 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:10,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:10,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1512562790, now seen corresponding path program 1 times [2024-10-11 14:01:10,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:10,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570184458] [2024-10-11 14:01:10,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:10,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:10,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:10,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570184458] [2024-10-11 14:01:10,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570184458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:10,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:10,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:01:10,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912020092] [2024-10-11 14:01:10,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:10,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:01:10,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:10,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:01:10,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:01:10,729 INFO L87 Difference]: Start difference. First operand 369 states and 512 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:10,828 INFO L93 Difference]: Finished difference Result 524 states and 727 transitions. [2024-10-11 14:01:10,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:01:10,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-11 14:01:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:10,830 INFO L225 Difference]: With dead ends: 524 [2024-10-11 14:01:10,830 INFO L226 Difference]: Without dead ends: 243 [2024-10-11 14:01:10,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:10,831 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 3 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:10,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 483 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:01:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-11 14:01:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2024-10-11 14:01:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 216 states have (on average 1.3240740740740742) internal successors, (286), 216 states have internal predecessors, (286), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 14:01:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 334 transitions. [2024-10-11 14:01:10,847 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 334 transitions. Word has length 116 [2024-10-11 14:01:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:10,849 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 334 transitions. [2024-10-11 14:01:10,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 334 transitions. [2024-10-11 14:01:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 14:01:10,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:10,850 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:10,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 14:01:10,851 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:10,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:10,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2017246109, now seen corresponding path program 1 times [2024-10-11 14:01:10,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:10,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629887028] [2024-10-11 14:01:10,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:10,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:10,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:11,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:11,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629887028] [2024-10-11 14:01:11,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629887028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:11,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:11,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:01:11,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517940229] [2024-10-11 14:01:11,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:11,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:01:11,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:11,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:01:11,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:01:11,003 INFO L87 Difference]: Start difference. First operand 243 states and 334 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:11,107 INFO L93 Difference]: Finished difference Result 432 states and 591 transitions. [2024-10-11 14:01:11,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:01:11,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-11 14:01:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:11,108 INFO L225 Difference]: With dead ends: 432 [2024-10-11 14:01:11,108 INFO L226 Difference]: Without dead ends: 280 [2024-10-11 14:01:11,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:11,110 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 37 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:11,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 474 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:01:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-11 14:01:11,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 248. [2024-10-11 14:01:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 221 states have (on average 1.3212669683257918) internal successors, (292), 221 states have internal predecessors, (292), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 14:01:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 340 transitions. [2024-10-11 14:01:11,124 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 340 transitions. Word has length 116 [2024-10-11 14:01:11,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:11,125 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 340 transitions. [2024-10-11 14:01:11,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:11,125 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 340 transitions. [2024-10-11 14:01:11,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 14:01:11,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:11,126 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:11,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 14:01:11,126 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:11,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:11,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1690915173, now seen corresponding path program 1 times [2024-10-11 14:01:11,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:11,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15393573] [2024-10-11 14:01:11,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:11,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15393573] [2024-10-11 14:01:11,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15393573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:11,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:11,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:01:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079581874] [2024-10-11 14:01:11,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:11,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:01:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:11,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:01:11,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:01:11,240 INFO L87 Difference]: Start difference. First operand 248 states and 340 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:11,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:11,276 INFO L93 Difference]: Finished difference Result 408 states and 559 transitions. [2024-10-11 14:01:11,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:01:11,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-11 14:01:11,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:11,278 INFO L225 Difference]: With dead ends: 408 [2024-10-11 14:01:11,278 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 14:01:11,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:01:11,278 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:11,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 557 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 14:01:11,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-10-11 14:01:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 224 states have (on average 1.3169642857142858) internal successors, (295), 224 states have internal predecessors, (295), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 14:01:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 343 transitions. [2024-10-11 14:01:11,295 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 343 transitions. Word has length 116 [2024-10-11 14:01:11,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:11,296 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 343 transitions. [2024-10-11 14:01:11,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-10-11 14:01:11,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 14:01:11,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:11,298 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:11,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 14:01:11,298 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:11,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:11,298 INFO L85 PathProgramCache]: Analyzing trace with hash -623685207, now seen corresponding path program 1 times [2024-10-11 14:01:11,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:11,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919621036] [2024-10-11 14:01:11,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:11,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,382 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:11,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:11,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919621036] [2024-10-11 14:01:11,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919621036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:11,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:11,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:11,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279653614] [2024-10-11 14:01:11,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:11,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:11,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:11,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:11,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:11,384 INFO L87 Difference]: Start difference. First operand 251 states and 343 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:11,437 INFO L93 Difference]: Finished difference Result 452 states and 614 transitions. [2024-10-11 14:01:11,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:11,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-11 14:01:11,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:11,439 INFO L225 Difference]: With dead ends: 452 [2024-10-11 14:01:11,439 INFO L226 Difference]: Without dead ends: 291 [2024-10-11 14:01:11,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:11,440 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 44 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:11,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 432 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:11,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-11 14:01:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 250. [2024-10-11 14:01:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 223 states have (on average 1.3094170403587444) internal successors, (292), 223 states have internal predecessors, (292), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 14:01:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 340 transitions. [2024-10-11 14:01:11,461 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 340 transitions. Word has length 117 [2024-10-11 14:01:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:11,461 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 340 transitions. [2024-10-11 14:01:11,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 340 transitions. [2024-10-11 14:01:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 14:01:11,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:11,462 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:11,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 14:01:11,463 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:11,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:11,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2110915733, now seen corresponding path program 1 times [2024-10-11 14:01:11,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:11,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672605088] [2024-10-11 14:01:11,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:11,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:11,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:11,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672605088] [2024-10-11 14:01:11,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672605088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:11,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:11,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:01:11,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858483268] [2024-10-11 14:01:11,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:11,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:01:11,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:11,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:01:11,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:11,616 INFO L87 Difference]: Start difference. First operand 250 states and 340 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:11,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:11,777 INFO L93 Difference]: Finished difference Result 454 states and 612 transitions. [2024-10-11 14:01:11,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:01:11,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-11 14:01:11,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:11,779 INFO L225 Difference]: With dead ends: 454 [2024-10-11 14:01:11,779 INFO L226 Difference]: Without dead ends: 293 [2024-10-11 14:01:11,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:01:11,780 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 135 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:11,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 600 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:01:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-11 14:01:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 250. [2024-10-11 14:01:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 223 states have (on average 1.304932735426009) internal successors, (291), 223 states have internal predecessors, (291), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 14:01:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 339 transitions. [2024-10-11 14:01:11,793 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 339 transitions. Word has length 117 [2024-10-11 14:01:11,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:11,794 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 339 transitions. [2024-10-11 14:01:11,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 339 transitions. [2024-10-11 14:01:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 14:01:11,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:11,796 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:11,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 14:01:11,796 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:11,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:11,797 INFO L85 PathProgramCache]: Analyzing trace with hash 116771027, now seen corresponding path program 1 times [2024-10-11 14:01:11,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:11,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51314778] [2024-10-11 14:01:11,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:11,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:12,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:12,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51314778] [2024-10-11 14:01:12,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51314778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:12,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:12,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:01:12,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928109670] [2024-10-11 14:01:12,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:12,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:01:12,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:12,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:01:12,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:12,055 INFO L87 Difference]: Start difference. First operand 250 states and 339 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:12,209 INFO L93 Difference]: Finished difference Result 428 states and 578 transitions. [2024-10-11 14:01:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:01:12,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-11 14:01:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:12,211 INFO L225 Difference]: With dead ends: 428 [2024-10-11 14:01:12,211 INFO L226 Difference]: Without dead ends: 250 [2024-10-11 14:01:12,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:01:12,212 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 115 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:12,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 406 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:01:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-11 14:01:12,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-10-11 14:01:12,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 223 states have (on average 1.295964125560538) internal successors, (289), 223 states have internal predecessors, (289), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 14:01:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 337 transitions. [2024-10-11 14:01:12,225 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 337 transitions. Word has length 117 [2024-10-11 14:01:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:12,225 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 337 transitions. [2024-10-11 14:01:12,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 337 transitions. [2024-10-11 14:01:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 14:01:12,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:12,227 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:12,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 14:01:12,227 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:12,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash 960473963, now seen corresponding path program 1 times [2024-10-11 14:01:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:12,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9377793] [2024-10-11 14:01:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:12,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:13,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:13,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:13,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:13,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:13,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:13,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:13,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:13,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:13,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:13,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:13,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:13,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9377793] [2024-10-11 14:01:13,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9377793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:13,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:13,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:01:13,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111621179] [2024-10-11 14:01:13,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:13,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:01:13,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:13,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:01:13,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:01:13,144 INFO L87 Difference]: Start difference. First operand 250 states and 337 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:01:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:13,373 INFO L93 Difference]: Finished difference Result 539 states and 727 transitions. [2024-10-11 14:01:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:13,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2024-10-11 14:01:13,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:13,375 INFO L225 Difference]: With dead ends: 539 [2024-10-11 14:01:13,375 INFO L226 Difference]: Without dead ends: 367 [2024-10-11 14:01:13,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:01:13,376 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 269 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:13,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 367 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:01:13,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-11 14:01:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 364. [2024-10-11 14:01:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 324 states have (on average 1.2932098765432098) internal successors, (419), 324 states have internal predecessors, (419), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:01:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 491 transitions. [2024-10-11 14:01:13,399 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 491 transitions. Word has length 119 [2024-10-11 14:01:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:13,400 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 491 transitions. [2024-10-11 14:01:13,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:01:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 491 transitions. [2024-10-11 14:01:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 14:01:13,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:13,401 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:13,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 14:01:13,401 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:13,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:13,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1259615048, now seen corresponding path program 1 times [2024-10-11 14:01:13,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:13,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951224561] [2024-10-11 14:01:13,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:13,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:01:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:14,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:14,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951224561] [2024-10-11 14:01:14,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951224561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:14,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:14,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:01:14,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225583351] [2024-10-11 14:01:14,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:14,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:01:14,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:14,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:01:14,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:01:14,092 INFO L87 Difference]: Start difference. First operand 364 states and 491 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:14,408 INFO L93 Difference]: Finished difference Result 557 states and 748 transitions. [2024-10-11 14:01:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:01:14,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-10-11 14:01:14,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:14,410 INFO L225 Difference]: With dead ends: 557 [2024-10-11 14:01:14,410 INFO L226 Difference]: Without dead ends: 395 [2024-10-11 14:01:14,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:01:14,411 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 391 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:14,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 355 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:01:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-11 14:01:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 353. [2024-10-11 14:01:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 313 states have (on average 1.29073482428115) internal successors, (404), 313 states have internal predecessors, (404), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:01:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 476 transitions. [2024-10-11 14:01:14,433 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 476 transitions. Word has length 119 [2024-10-11 14:01:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:14,433 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 476 transitions. [2024-10-11 14:01:14,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 476 transitions. [2024-10-11 14:01:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 14:01:14,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:14,435 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:14,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 14:01:14,435 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:14,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1383454926, now seen corresponding path program 1 times [2024-10-11 14:01:14,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:14,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946150312] [2024-10-11 14:01:14,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:14,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:01:14,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:01:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:01:14,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:01:14,602 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:01:14,603 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 14:01:14,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 14:01:14,606 INFO L407 BasicCegarLoop]: Path program histogram: [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 14:01:14,713 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:01:14,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:01:14 BoogieIcfgContainer [2024-10-11 14:01:14,714 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:01:14,715 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:01:14,715 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:01:14,715 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:01:14,715 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:01:03" (3/4) ... [2024-10-11 14:01:14,717 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 14:01:14,717 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:01:14,718 INFO L158 Benchmark]: Toolchain (without parser) took 12639.56ms. Allocated memory was 180.4MB in the beginning and 488.6MB in the end (delta: 308.3MB). Free memory was 149.5MB in the beginning and 262.5MB in the end (delta: -112.9MB). Peak memory consumption was 195.2MB. Max. memory is 16.1GB. [2024-10-11 14:01:14,718 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 92.7MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:01:14,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.98ms. Allocated memory is still 180.4MB. Free memory was 149.5MB in the beginning and 132.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 14:01:14,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.67ms. Allocated memory is still 180.4MB. Free memory was 132.2MB in the beginning and 128.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:01:14,719 INFO L158 Benchmark]: Boogie Preprocessor took 56.96ms. Allocated memory is still 180.4MB. Free memory was 128.1MB in the beginning and 123.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:01:14,719 INFO L158 Benchmark]: RCFGBuilder took 611.58ms. Allocated memory is still 180.4MB. Free memory was 123.2MB in the beginning and 140.9MB in the end (delta: -17.7MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-10-11 14:01:14,719 INFO L158 Benchmark]: TraceAbstraction took 11602.21ms. Allocated memory was 180.4MB in the beginning and 488.6MB in the end (delta: 308.3MB). Free memory was 139.8MB in the beginning and 263.5MB in the end (delta: -123.7MB). Peak memory consumption was 183.6MB. Max. memory is 16.1GB. [2024-10-11 14:01:14,719 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 488.6MB. Free memory was 263.5MB in the beginning and 262.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:01:14,720 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 92.7MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.98ms. Allocated memory is still 180.4MB. Free memory was 149.5MB in the beginning and 132.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.67ms. Allocated memory is still 180.4MB. Free memory was 132.2MB in the beginning and 128.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.96ms. Allocated memory is still 180.4MB. Free memory was 128.1MB in the beginning and 123.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 611.58ms. Allocated memory is still 180.4MB. Free memory was 123.2MB in the beginning and 140.9MB in the end (delta: -17.7MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11602.21ms. Allocated memory was 180.4MB in the beginning and 488.6MB in the end (delta: 308.3MB). Free memory was 139.8MB in the beginning and 263.5MB in the end (delta: -123.7MB). Peak memory consumption was 183.6MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 488.6MB. Free memory was 263.5MB in the beginning and 262.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 130, overapproximation of shiftRight at line 93, overapproximation of someBinaryArithmeticDOUBLEoperation at line 88. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L55] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L58] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L59] double* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L60] double* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L61] double* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L62] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L63] signed long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L64] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L65] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L66] unsigned long int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L67] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L68] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L69] signed long int last_1_WrapperStruct00_var_1_12 = -5; [L70] unsigned char last_1_WrapperStruct00_var_1_17 = 2; [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L126] EXPR WrapperStruct00.var_1_12 [L126] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L127] EXPR WrapperStruct00.var_1_17 [L127] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L137] RET updateLastVariables() [L138] CALL updateVariables() [L104] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L107] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L110] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_8 [L111] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_8 [L111] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L112] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L113] EXPR WrapperStruct00.var_1_9 [L113] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_9 [L113] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L114] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L115] EXPR WrapperStruct00.var_1_10 [L115] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_10 [L115] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L117] EXPR WrapperStruct00.var_1_11 [L117] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_11 [L117] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L118] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L121] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L123] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L138] RET updateVariables() [L139] CALL step() [L74] unsigned char stepLocal_1 = last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17; [L75] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_17; [L76] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L76] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) [L77] stepLocal_1 && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L77] stepLocal_1 && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L77] COND FALSE !(stepLocal_1 && (*(WrapperStruct00_var_1_5_Pointer))) [L87] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L87] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) [L88] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L88] (*(WrapperStruct00_var_1_7_Pointer)) = ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))) [L90] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L90] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L91] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L91] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L92] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L92] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L93] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L93] EXPR -4 >> (*(WrapperStruct00_var_1_1_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L93] EXPR (((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L93] EXPR -4 >> (*(WrapperStruct00_var_1_1_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] EXPR (((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] signed long int stepLocal_3 = ((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))); [L94] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L94] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_1_Pointer)) / -8; [L95] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L95] COND FALSE !((~ (*(WrapperStruct00_var_1_17_Pointer))) <= stepLocal_3) [L100] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L100] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L100] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))) [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17)) [L130] EXPR (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1 [L130] EXPR ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1) [L130] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1 [L130] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130-L131] return ((((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 22, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2034 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2034 mSDsluCounter, 9613 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6629 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2856 IncrementalHoareTripleChecker+Invalid, 3078 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 2984 mSDtfsCounter, 2856 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 669 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=13, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 524 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2514 NumberOfCodeBlocks, 2514 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2372 ConstructedInterpolants, 0 QuantifiedInterpolants, 12595 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 5544/5544 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 14:01:14,760 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-sp_file-55.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 f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:01:16,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:01:16,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 14:01:16,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:01:16,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:01:16,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:01:16,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:01:16,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:01:16,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:01:16,668 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:01:16,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:01:16,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:01:16,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:01:16,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:01:16,670 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:01:16,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:01:16,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:01:16,671 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:01:16,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:01:16,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:01:16,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:01:16,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:01:16,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:01:16,675 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 14:01:16,675 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 14:01:16,676 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:01:16,676 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 14:01:16,676 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:01:16,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:01:16,676 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:01:16,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:01:16,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:01:16,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:01:16,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:01:16,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:01:16,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:01:16,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:01:16,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:01:16,678 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 14:01:16,678 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 14:01:16,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:01:16,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:01:16,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:01:16,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:01:16,680 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 14:01:16,680 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 -> f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da [2024-10-11 14:01:16,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:01:16,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:01:16,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:01:16,950 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:01:16,951 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:01:16,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.i [2024-10-11 14:01:18,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:01:18,391 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:01:18,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.i [2024-10-11 14:01:18,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6b16beca9/f9586fc00b1046edb90400dee66285e9/FLAG7427febf1 [2024-10-11 14:01:18,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6b16beca9/f9586fc00b1046edb90400dee66285e9 [2024-10-11 14:01:18,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:01:18,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:01:18,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:01:18,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:01:18,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:01:18,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:01:18" (1/1) ... [2024-10-11 14:01:18,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c01082f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18, skipping insertion in model container [2024-10-11 14:01:18,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:01:18" (1/1) ... [2024-10-11 14:01:18,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:01:18,570 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-sp_file-55.i[917,930] [2024-10-11 14:01:18,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:01:18,654 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:01:18,664 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-sp_file-55.i[917,930] [2024-10-11 14:01:18,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:01:18,719 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:01:18,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18 WrapperNode [2024-10-11 14:01:18,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:01:18,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:01:18,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:01:18,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:01:18,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18" (1/1) ... [2024-10-11 14:01:18,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18" (1/1) ... [2024-10-11 14:01:18,763 INFO L138 Inliner]: procedures = 39, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 429 [2024-10-11 14:01:18,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:01:18,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:01:18,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:01:18,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:01:18,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18" (1/1) ... [2024-10-11 14:01:18,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18" (1/1) ... [2024-10-11 14:01:18,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18" (1/1) ... [2024-10-11 14:01:18,802 INFO L175 MemorySlicer]: Split 108 memory accesses to 2 slices as follows [2, 106]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 17 writes are split as follows [0, 17]. [2024-10-11 14:01:18,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18" (1/1) ... [2024-10-11 14:01:18,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18" (1/1) ... [2024-10-11 14:01:18,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18" (1/1) ... [2024-10-11 14:01:18,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18" (1/1) ... [2024-10-11 14:01:18,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18" (1/1) ... [2024-10-11 14:01:18,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18" (1/1) ... [2024-10-11 14:01:18,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:01:18,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:01:18,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:01:18,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:01:18,863 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18" (1/1) ... [2024-10-11 14:01:18,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:01:18,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:01:18,890 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 14:01:18,892 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 14:01:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:01:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 14:01:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 14:01:18,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 14:01:18,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 14:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 14:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 14:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 14:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 14:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 14:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 14:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 14:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 14:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 14:01:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 14:01:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 14:01:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 14:01:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 14:01:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 14:01:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 14:01:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 14:01:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 14:01:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 14:01:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 14:01:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 14:01:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:01:18,925 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:01:18,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:01:18,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:01:18,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 14:01:18,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 14:01:18,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 14:01:18,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 14:01:18,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 14:01:18,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 14:01:19,053 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:01:19,054 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:01:21,907 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-10-11 14:01:21,908 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:01:21,945 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:01:21,945 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:01:21,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:01:21 BoogieIcfgContainer [2024-10-11 14:01:21,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:01:21,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:01:21,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:01:21,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:01:21,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:01:18" (1/3) ... [2024-10-11 14:01:21,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75634ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:01:21, skipping insertion in model container [2024-10-11 14:01:21,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:18" (2/3) ... [2024-10-11 14:01:21,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75634ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:01:21, skipping insertion in model container [2024-10-11 14:01:21,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:01:21" (3/3) ... [2024-10-11 14:01:21,957 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-55.i [2024-10-11 14:01:21,968 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:01:21,968 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:01:22,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:01:22,016 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;@5c4dfa1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:01:22,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:01:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 78 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:22,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 14:01:22,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:22,028 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:22,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:22,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2132164271, now seen corresponding path program 1 times [2024-10-11 14:01:22,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:01:22,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795989411] [2024-10-11 14:01:22,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:22,042 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 14:01:22,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:01:22,043 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 14:01:22,044 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 14:01:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 14:01:22,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-10-11 14:01:22,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:01:22,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:01:22,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795989411] [2024-10-11 14:01:22,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795989411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:22,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:22,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:01:22,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75073631] [2024-10-11 14:01:22,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:22,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:01:22,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:01:22,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:01:22,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:01:22,570 INFO L87 Difference]: Start difference. First operand has 92 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 78 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:22,615 INFO L93 Difference]: Finished difference Result 181 states and 288 transitions. [2024-10-11 14:01:22,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:01:22,617 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-10-11 14:01:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:22,622 INFO L225 Difference]: With dead ends: 181 [2024-10-11 14:01:22,622 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 14:01:22,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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 14:01:22,631 INFO L432 NwaCegarLoop]: 128 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, 128 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 14:01:22,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:22,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 14:01:22,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 14:01:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-10-11 14:01:22,667 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 108 [2024-10-11 14:01:22,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:22,668 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-10-11 14:01:22,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-10-11 14:01:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 14:01:22,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:22,673 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:22,688 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 14:01:22,873 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 14:01:22,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:22,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2053342689, now seen corresponding path program 1 times [2024-10-11 14:01:22,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:01:22,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211859756] [2024-10-11 14:01:22,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:22,876 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 14:01:22,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:01:22,877 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 14:01:22,878 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 14:01:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 14:01:23,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-11 14:01:23,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:01:23,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:01:23,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211859756] [2024-10-11 14:01:23,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211859756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:23,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:23,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:23,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705060372] [2024-10-11 14:01:23,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:23,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:23,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:01:23,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:23,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:23,337 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:23,431 INFO L93 Difference]: Finished difference Result 181 states and 266 transitions. [2024-10-11 14:01:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:23,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-10-11 14:01:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:23,433 INFO L225 Difference]: With dead ends: 181 [2024-10-11 14:01:23,433 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 14:01:23,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:23,434 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:23,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 371 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:01:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 14:01:23,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 14:01:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-11 14:01:23,442 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 108 [2024-10-11 14:01:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:23,443 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-11 14:01:23,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-11 14:01:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 14:01:23,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:23,444 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:23,459 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 14:01:23,645 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 14:01:23,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:23,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:23,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1998949791, now seen corresponding path program 1 times [2024-10-11 14:01:23,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:01:23,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677680487] [2024-10-11 14:01:23,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:23,648 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 14:01:23,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:01:23,650 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 14:01:23,650 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 14:01:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 14:01:24,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:24,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:01:24,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:01:24,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677680487] [2024-10-11 14:01:24,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677680487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:24,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:24,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:01:24,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069056126] [2024-10-11 14:01:24,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:24,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:01:24,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:01:24,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:01:24,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:01:24,144 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:24,296 INFO L93 Difference]: Finished difference Result 188 states and 274 transitions. [2024-10-11 14:01:24,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:01:24,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-10-11 14:01:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:24,298 INFO L225 Difference]: With dead ends: 188 [2024-10-11 14:01:24,298 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 14:01:24,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:01:24,300 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:24,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 482 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:01:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 14:01:24,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-11 14:01:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-10-11 14:01:24,306 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 108 [2024-10-11 14:01:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:24,307 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-10-11 14:01:24,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-10-11 14:01:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 14:01:24,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:24,308 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:24,325 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 14:01:24,509 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 14:01:24,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:24,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1486670879, now seen corresponding path program 1 times [2024-10-11 14:01:24,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:01:24,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146348781] [2024-10-11 14:01:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:24,511 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 14:01:24,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:01:24,513 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 14:01:24,515 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 14:01:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 14:01:24,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:24,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:01:24,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:01:24,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146348781] [2024-10-11 14:01:24,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146348781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:24,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:24,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:01:24,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317715149] [2024-10-11 14:01:24,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:24,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:01:24,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:01:24,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:01:24,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:24,953 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:25,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:25,130 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-10-11 14:01:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:01:25,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-10-11 14:01:25,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:25,132 INFO L225 Difference]: With dead ends: 194 [2024-10-11 14:01:25,132 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 14:01:25,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:25,134 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:25,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 593 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:01:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 14:01:25,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-11 14:01:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-10-11 14:01:25,142 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 108 [2024-10-11 14:01:25,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:25,143 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-10-11 14:01:25,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-10-11 14:01:25,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 14:01:25,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:25,148 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:25,163 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 (5)] Forceful destruction successful, exit code 0 [2024-10-11 14:01:25,348 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 14:01:25,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:25,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:25,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1543929181, now seen corresponding path program 1 times [2024-10-11 14:01:25,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:01:25,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392354370] [2024-10-11 14:01:25,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:25,350 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 14:01:25,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:01:25,352 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 14:01:25,355 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 14:01:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:25,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 14:01:25,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:01:25,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:01:25,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:01:25,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392354370] [2024-10-11 14:01:25,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392354370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:25,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:25,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:01:25,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038800569] [2024-10-11 14:01:25,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:25,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:01:25,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:01:25,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:01:25,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:01:25,782 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:26,032 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-10-11 14:01:26,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:26,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-10-11 14:01:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:26,034 INFO L225 Difference]: With dead ends: 198 [2024-10-11 14:01:26,034 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 14:01:26,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:01:26,035 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:26,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 706 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:01:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 14:01:26,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-11 14:01:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-10-11 14:01:26,041 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 108 [2024-10-11 14:01:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:26,041 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-10-11 14:01:26,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:01:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-10-11 14:01:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 14:01:26,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:26,043 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:26,058 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 14:01:26,243 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 14:01:26,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:26,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:26,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1543988763, now seen corresponding path program 1 times [2024-10-11 14:01:26,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:01:26,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623644797] [2024-10-11 14:01:26,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:26,245 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 14:01:26,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:01:26,246 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 14:01:26,246 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 14:01:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 14:01:26,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:26,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:01:26,762 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 14:01:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-11 14:01:26,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:01:26,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:01:26,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623644797] [2024-10-11 14:01:26,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623644797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:26,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:26,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:01:26,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887740576] [2024-10-11 14:01:26,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:26,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:01:26,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:01:26,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:01:26,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:26,794 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:29,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:01:31,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:01:32,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:32,231 INFO L93 Difference]: Finished difference Result 200 states and 284 transitions. [2024-10-11 14:01:32,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:32,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-10-11 14:01:32,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:32,233 INFO L225 Difference]: With dead ends: 200 [2024-10-11 14:01:32,233 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 14:01:32,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 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 14:01:32,234 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 115 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:32,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 365 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-11 14:01:32,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 14:01:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-11 14:01:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2024-10-11 14:01:32,240 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 108 [2024-10-11 14:01:32,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:32,240 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2024-10-11 14:01:32,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2024-10-11 14:01:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 14:01:32,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:32,242 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:32,261 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 (7)] Forceful destruction successful, exit code 0 [2024-10-11 14:01:32,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 14:01:32,442 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:32,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:32,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1944154921, now seen corresponding path program 1 times [2024-10-11 14:01:32,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:01:32,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503472577] [2024-10-11 14:01:32,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:32,443 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 14:01:32,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:01:32,444 INFO L229 MonitoredProcess]: Starting monitored process 8 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 14:01:32,445 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 (8)] Waiting until timeout for monitored process [2024-10-11 14:01:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:32,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 14:01:32,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 14:01:32,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:01:32,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:01:32,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503472577] [2024-10-11 14:01:32,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503472577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:32,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:32,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:01:32,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383596719] [2024-10-11 14:01:32,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:32,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:01:32,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:01:32,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:01:32,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:32,867 INFO L87 Difference]: Start difference. First operand 100 states and 141 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:01:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:33,028 INFO L93 Difference]: Finished difference Result 203 states and 286 transitions. [2024-10-11 14:01:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:33,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2024-10-11 14:01:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:33,029 INFO L225 Difference]: With dead ends: 203 [2024-10-11 14:01:33,029 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 14:01:33,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:01:33,030 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:33,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 528 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:01:33,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 14:01:33,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-10-11 14:01:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 140 transitions. [2024-10-11 14:01:33,043 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 140 transitions. Word has length 110 [2024-10-11 14:01:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:33,043 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 140 transitions. [2024-10-11 14:01:33,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:01:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2024-10-11 14:01:33,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 14:01:33,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:33,045 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:33,061 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 (8)] Forceful destruction successful, exit code 0 [2024-10-11 14:01:33,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 14:01:33,245 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:33,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:33,246 INFO L85 PathProgramCache]: Analyzing trace with hash -886316843, now seen corresponding path program 1 times [2024-10-11 14:01:33,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:01:33,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204201659] [2024-10-11 14:01:33,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:33,246 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 14:01:33,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:01:33,247 INFO L229 MonitoredProcess]: Starting monitored process 9 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 14:01:33,248 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 (9)] Waiting until timeout for monitored process [2024-10-11 14:01:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 14:01:33,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:33,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:01:33,791 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 14:01:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 14:01:33,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:01:33,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:01:33,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204201659] [2024-10-11 14:01:33,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204201659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:33,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:33,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:01:33,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841338338] [2024-10-11 14:01:33,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:33,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:01:33,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:01:33,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:01:33,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:33,823 INFO L87 Difference]: Start difference. First operand 100 states and 140 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:36,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:01:39,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:01:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:39,668 INFO L93 Difference]: Finished difference Result 200 states and 280 transitions. [2024-10-11 14:01:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:39,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-10-11 14:01:39,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:39,670 INFO L225 Difference]: With dead ends: 200 [2024-10-11 14:01:39,670 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 14:01:39,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 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 14:01:39,671 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 105 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:39,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-11 14:01:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 14:01:39,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-11 14:01:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2024-10-11 14:01:39,678 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 110 [2024-10-11 14:01:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:39,678 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2024-10-11 14:01:39,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2024-10-11 14:01:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 14:01:39,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:39,679 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:39,695 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 (9)] Ended with exit code 0 [2024-10-11 14:01:39,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 14:01:39,881 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:39,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:39,881 INFO L85 PathProgramCache]: Analyzing trace with hash -307408933, now seen corresponding path program 1 times [2024-10-11 14:01:39,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:01:39,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647999639] [2024-10-11 14:01:39,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:39,883 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 14:01:39,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:01:39,884 INFO L229 MonitoredProcess]: Starting monitored process 10 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 14:01:39,889 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 (10)] Waiting until timeout for monitored process [2024-10-11 14:01:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:40,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 14:01:40,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:40,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:01:40,410 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 14:01:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-11 14:01:40,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:01:40,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:01:40,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647999639] [2024-10-11 14:01:40,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647999639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:40,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:40,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:01:40,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780974622] [2024-10-11 14:01:40,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:40,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:01:40,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:01:40,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:01:40,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:40,441 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:42,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:01:44,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:01:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:44,898 INFO L93 Difference]: Finished difference Result 199 states and 277 transitions. [2024-10-11 14:01:44,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:44,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2024-10-11 14:01:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:44,900 INFO L225 Difference]: With dead ends: 199 [2024-10-11 14:01:44,900 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 14:01:44,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:01:44,901 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 96 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:44,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 353 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 14:01:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 14:01:44,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-10-11 14:01:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 84 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2024-10-11 14:01:44,905 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 112 [2024-10-11 14:01:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:44,906 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2024-10-11 14:01:44,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:01:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2024-10-11 14:01:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 14:01:44,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:44,907 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:44,922 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 (10)] Forceful destruction successful, exit code 0 [2024-10-11 14:01:45,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 14:01:45,108 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:45,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:45,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1726953261, now seen corresponding path program 1 times [2024-10-11 14:01:45,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:01:45,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127350610] [2024-10-11 14:01:45,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:45,109 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 14:01:45,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:01:45,111 INFO L229 MonitoredProcess]: Starting monitored process 11 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 14:01:45,111 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 (11)] Waiting until timeout for monitored process [2024-10-11 14:01:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:45,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 14:01:45,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:45,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:01:45,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 64 [2024-10-11 14:01:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 24 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 14:01:45,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:01:46,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:01:46,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2024-10-11 14:01:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-11 14:01:46,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:01:46,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127350610] [2024-10-11 14:01:46,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127350610] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:01:46,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:01:46,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-11 14:01:46,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501712297] [2024-10-11 14:01:46,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 14:01:46,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:01:46,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:01:46,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:01:46,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:01:46,057 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-11 14:01:48,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:01:53,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:01:56,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:01:56,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:56,845 INFO L93 Difference]: Finished difference Result 208 states and 286 transitions. [2024-10-11 14:01:56,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 14:01:56,846 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 114 [2024-10-11 14:01:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:56,846 INFO L225 Difference]: With dead ends: 208 [2024-10-11 14:01:56,846 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 14:01:56,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-11 14:01:56,849 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 102 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:56,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 630 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-10-11 14:01:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 14:01:56,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-10-11 14:01:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:01:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2024-10-11 14:01:56,852 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 114 [2024-10-11 14:01:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:56,853 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2024-10-11 14:01:56,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-11 14:01:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2024-10-11 14:01:56,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 14:01:56,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:56,854 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:56,870 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 (11)] Forceful destruction successful, exit code 0 [2024-10-11 14:01:57,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 14:01:57,054 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:57,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash -994985835, now seen corresponding path program 1 times [2024-10-11 14:01:57,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:01:57,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865183575] [2024-10-11 14:01:57,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:57,055 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 14:01:57,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:01:57,056 INFO L229 MonitoredProcess]: Starting monitored process 12 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 14:01:57,057 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 (12)] Waiting until timeout for monitored process [2024-10-11 14:01:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:57,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 14:01:57,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:57,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:01:57,660 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 14:01:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 14:01:57,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:01:57,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:01:57,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865183575] [2024-10-11 14:01:57,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865183575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:57,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:57,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:01:57,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598793919] [2024-10-11 14:01:57,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:57,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:01:57,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:01:57,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:01:57,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:57,685 INFO L87 Difference]: Start difference. First operand 98 states and 134 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:00,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:02:01,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:02:03,818 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 14:02:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:04,089 INFO L93 Difference]: Finished difference Result 196 states and 268 transitions. [2024-10-11 14:02:04,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:02:04,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2024-10-11 14:02:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:04,091 INFO L225 Difference]: With dead ends: 196 [2024-10-11 14:02:04,091 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 14:02:04,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 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 14:02:04,091 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 85 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:04,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 339 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-10-11 14:02:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 14:02:04,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-11 14:02:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 133 transitions. [2024-10-11 14:02:04,096 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 133 transitions. Word has length 114 [2024-10-11 14:02:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:04,096 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 133 transitions. [2024-10-11 14:02:04,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 133 transitions. [2024-10-11 14:02:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 14:02:04,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:04,097 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:04,113 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 (12)] Forceful destruction successful, exit code 0 [2024-10-11 14:02:04,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 14:02:04,297 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:04,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:04,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1505810021, now seen corresponding path program 1 times [2024-10-11 14:02:04,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:02:04,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807465636] [2024-10-11 14:02:04,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:04,298 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 14:02:04,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:02:04,301 INFO L229 MonitoredProcess]: Starting monitored process 13 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 14:02:04,301 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 (13)] Waiting until timeout for monitored process [2024-10-11 14:02:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:04,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 14:02:04,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:02:04,925 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 14:02:05,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:02:05,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2024-10-11 14:02:05,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2024-10-11 14:02:09,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2024-10-11 14:02:09,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2024-10-11 14:02:16,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-10-11 14:02:16,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2024-10-11 14:02:17,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:02:17,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 56 [2024-10-11 14:02:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 135 proven. 104 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 14:02:17,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:02:17,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:02:17,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807465636] [2024-10-11 14:02:17,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807465636] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:02:17,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1626825912] [2024-10-11 14:02:17,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:17,369 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 14:02:17,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 14:02:17,371 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 14:02:17,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-10-11 14:02:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:19,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 14:02:19,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:02:19,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 14:02:19,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 14:02:19,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-10-11 14:02:19,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-10-11 14:02:19,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-10-11 14:02:20,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-10-11 14:02:22,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-11 14:02:22,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-11 14:02:25,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-11 14:02:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 84 proven. 80 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 14:02:25,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:02:25,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1626825912] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:02:25,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:02:25,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2024-10-11 14:02:25,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128426206] [2024-10-11 14:02:25,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 14:02:25,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 14:02:25,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:02:25,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 14:02:25,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=378, Unknown=5, NotChecked=0, Total=462 [2024-10-11 14:02:25,660 INFO L87 Difference]: Start difference. First operand 98 states and 133 transitions. Second operand has 19 states, 18 states have (on average 6.777777777777778) internal successors, (122), 18 states have internal predecessors, (122), 10 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 9 states have call predecessors, (24), 10 states have call successors, (24) [2024-10-11 14:02:29,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]