./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1a2bcd66d87d7ad4b83fe3db6aada8f59760a9add58b963015dd7d640f76e7f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:15:48,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:15:48,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:15:48,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:15:48,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:15:48,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:15:48,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:15:48,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:15:48,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:15:48,370 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:15:48,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:15:48,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:15:48,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:15:48,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:15:48,372 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:15:48,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:15:48,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:15:48,373 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:15:48,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:15:48,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:15:48,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:15:48,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:15:48,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:15:48,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:15:48,376 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:15:48,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:15:48,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:15:48,377 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:15:48,377 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:15:48,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:15:48,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:15:48,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:15:48,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:15:48,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:15:48,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:15:48,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:15:48,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:15:48,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:15:48,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:15:48,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:15:48,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:15:48,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:15:48,382 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1a2bcd66d87d7ad4b83fe3db6aada8f59760a9add58b963015dd7d640f76e7f [2024-11-09 02:15:48,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:15:48,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:15:48,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:15:48,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:15:48,683 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:15:48,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i [2024-11-09 02:15:50,100 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:15:50,295 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:15:50,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i [2024-11-09 02:15:50,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a884daeb/6d8f469fd6be4cb08997980e6cd5ea07/FLAGf77271d2e [2024-11-09 02:15:50,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a884daeb/6d8f469fd6be4cb08997980e6cd5ea07 [2024-11-09 02:15:50,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:15:50,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:15:50,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:15:50,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:15:50,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:15:50,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:15:50" (1/1) ... [2024-11-09 02:15:50,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@431742b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50, skipping insertion in model container [2024-11-09 02:15:50,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:15:50" (1/1) ... [2024-11-09 02:15:50,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:15:50,541 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i[917,930] [2024-11-09 02:15:50,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:15:50,619 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:15:50,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i[917,930] [2024-11-09 02:15:50,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:15:50,705 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:15:50,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50 WrapperNode [2024-11-09 02:15:50,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:15:50,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:15:50,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:15:50,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:15:50,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50" (1/1) ... [2024-11-09 02:15:50,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50" (1/1) ... [2024-11-09 02:15:50,769 INFO L138 Inliner]: procedures = 30, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 496 [2024-11-09 02:15:50,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:15:50,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:15:50,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:15:50,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:15:50,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50" (1/1) ... [2024-11-09 02:15:50,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50" (1/1) ... [2024-11-09 02:15:50,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50" (1/1) ... [2024-11-09 02:15:50,795 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:15:50,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50" (1/1) ... [2024-11-09 02:15:50,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50" (1/1) ... [2024-11-09 02:15:50,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50" (1/1) ... [2024-11-09 02:15:50,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50" (1/1) ... [2024-11-09 02:15:50,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50" (1/1) ... [2024-11-09 02:15:50,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50" (1/1) ... [2024-11-09 02:15:50,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:15:50,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:15:50,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:15:50,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:15:50,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50" (1/1) ... [2024-11-09 02:15:50,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:15:50,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:15:50,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:15:50,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:15:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:15:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:15:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:15:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:15:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:15:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:15:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:15:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:15:50,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:15:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:15:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:15:50,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:15:51,095 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:15:51,098 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:15:51,781 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-09 02:15:51,782 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:15:51,799 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:15:51,801 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:15:51,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:15:51 BoogieIcfgContainer [2024-11-09 02:15:51,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:15:51,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:15:51,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:15:51,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:15:51,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:15:50" (1/3) ... [2024-11-09 02:15:51,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254bea82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:15:51, skipping insertion in model container [2024-11-09 02:15:51,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:50" (2/3) ... [2024-11-09 02:15:51,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254bea82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:15:51, skipping insertion in model container [2024-11-09 02:15:51,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:15:51" (3/3) ... [2024-11-09 02:15:51,813 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-65.i [2024-11-09 02:15:51,831 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:15:51,832 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:15:51,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:15:51,904 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;@541dee7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:15:51,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:15:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:15:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 02:15:51,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:51,922 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:15:51,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:51,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:51,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1229666287, now seen corresponding path program 1 times [2024-11-09 02:15:51,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:51,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812962727] [2024-11-09 02:15:51,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:51,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:52,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:52,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:15:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:52,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:52,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:15:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:52,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:52,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:15:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:52,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:15:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:52,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:15:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:52,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:15:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:15:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 02:15:52,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:52,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812962727] [2024-11-09 02:15:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812962727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:52,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:52,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:15:52,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083491687] [2024-11-09 02:15:52,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:52,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:15:52,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:52,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:15:52,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:52,680 INFO L87 Difference]: Start difference. First operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 02:15:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:52,752 INFO L93 Difference]: Finished difference Result 221 states and 340 transitions. [2024-11-09 02:15:52,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:15:52,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-09 02:15:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:52,763 INFO L225 Difference]: With dead ends: 221 [2024-11-09 02:15:52,763 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 02:15:52,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:52,772 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:52,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:15:52,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 02:15:52,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 02:15:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:15:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-09 02:15:52,823 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 112 [2024-11-09 02:15:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:52,826 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-09 02:15:52,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 02:15:52,826 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-09 02:15:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 02:15:52,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:52,830 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:15:52,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:15:52,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:52,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:52,831 INFO L85 PathProgramCache]: Analyzing trace with hash 668966509, now seen corresponding path program 1 times [2024-11-09 02:15:52,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:52,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386361959] [2024-11-09 02:15:52,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:52,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:15:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:15:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:15:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:15:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:15:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:15:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:15:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 02:15:53,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:53,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386361959] [2024-11-09 02:15:53,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386361959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:53,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:53,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:15:53,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376280868] [2024-11-09 02:15:53,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:53,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:15:53,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:53,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:15:53,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:15:53,302 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:15:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:53,357 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-09 02:15:53,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:15:53,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-09 02:15:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:53,359 INFO L225 Difference]: With dead ends: 222 [2024-11-09 02:15:53,359 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 02:15:53,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-11-09 02:15:53,361 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:53,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:15:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 02:15:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-09 02:15:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:15:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-09 02:15:53,372 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 112 [2024-11-09 02:15:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:53,372 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-09 02:15:53,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:15:53,373 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-09 02:15:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 02:15:53,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:53,375 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:15:53,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:15:53,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:53,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2043589665, now seen corresponding path program 1 times [2024-11-09 02:15:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:53,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428665840] [2024-11-09 02:15:53,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:53,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:15:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:15:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:15:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:15:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:15:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:15:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:15:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,571 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 02:15:53,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:53,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428665840] [2024-11-09 02:15:53,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428665840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:53,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:53,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:15:53,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072344748] [2024-11-09 02:15:53,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:53,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:15:53,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:53,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:15:53,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:53,578 INFO L87 Difference]: Start difference. First operand 114 states and 162 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:15:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:53,615 INFO L93 Difference]: Finished difference Result 228 states and 325 transitions. [2024-11-09 02:15:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:15:53,616 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-09 02:15:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:53,618 INFO L225 Difference]: With dead ends: 228 [2024-11-09 02:15:53,618 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 02:15:53,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:53,620 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:53,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:15:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 02:15:53,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-09 02:15:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 103 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:15:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2024-11-09 02:15:53,633 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 112 [2024-11-09 02:15:53,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:53,634 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2024-11-09 02:15:53,634 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:15:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2024-11-09 02:15:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 02:15:53,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:53,636 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:15:53,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:15:53,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:53,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:53,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1363531295, now seen corresponding path program 1 times [2024-11-09 02:15:53,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:53,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166272606] [2024-11-09 02:15:53,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:53,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:15:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:15:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:15:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:15:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:15:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:15:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:15:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 02:15:53,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:53,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166272606] [2024-11-09 02:15:53,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166272606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:53,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:53,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:15:53,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465142695] [2024-11-09 02:15:53,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:53,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:15:53,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:53,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:15:53,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:53,856 INFO L87 Difference]: Start difference. First operand 116 states and 164 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:15:53,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:53,881 INFO L93 Difference]: Finished difference Result 232 states and 329 transitions. [2024-11-09 02:15:53,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:15:53,882 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-09 02:15:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:53,884 INFO L225 Difference]: With dead ends: 232 [2024-11-09 02:15:53,884 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 02:15:53,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:53,886 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:53,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 452 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:15:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 02:15:53,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-09 02:15:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:15:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2024-11-09 02:15:53,894 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 112 [2024-11-09 02:15:53,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:53,895 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2024-11-09 02:15:53,895 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:15:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2024-11-09 02:15:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 02:15:53,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:53,897 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:15:53,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:15:53,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:53,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:53,899 INFO L85 PathProgramCache]: Analyzing trace with hash 411476067, now seen corresponding path program 1 times [2024-11-09 02:15:53,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:53,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519556844] [2024-11-09 02:15:53,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:53,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:54,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:54,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:54,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:15:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:54,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:54,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:15:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:54,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:54,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:15:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:54,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:15:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:54,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:15:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:54,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:15:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:54,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:15:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 02:15:54,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:54,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519556844] [2024-11-09 02:15:54,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519556844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:54,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:54,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:15:54,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589124188] [2024-11-09 02:15:54,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:54,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:15:54,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:54,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:15:54,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:15:54,139 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:15:54,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:54,181 INFO L93 Difference]: Finished difference Result 236 states and 333 transitions. [2024-11-09 02:15:54,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:15:54,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-09 02:15:54,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:54,186 INFO L225 Difference]: With dead ends: 236 [2024-11-09 02:15:54,186 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 02:15:54,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-11-09 02:15:54,189 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:54,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 597 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:15:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 02:15:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-09 02:15:54,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:15:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2024-11-09 02:15:54,198 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 112 [2024-11-09 02:15:54,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:54,198 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2024-11-09 02:15:54,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:15:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2024-11-09 02:15:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 02:15:54,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:54,201 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:15:54,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:15:54,201 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:54,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:54,202 INFO L85 PathProgramCache]: Analyzing trace with hash 413323109, now seen corresponding path program 1 times [2024-11-09 02:15:54,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:54,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630242768] [2024-11-09 02:15:54,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:54,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:15:54,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:15:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:15:54,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:15:54,490 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:15:54,491 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 02:15:54,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:15:54,499 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 02:15:54,635 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:15:54,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:15:54 BoogieIcfgContainer [2024-11-09 02:15:54,638 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:15:54,638 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:15:54,638 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:15:54,639 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:15:54,641 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:15:51" (3/4) ... [2024-11-09 02:15:54,643 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 02:15:54,644 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:15:54,645 INFO L158 Benchmark]: Toolchain (without parser) took 4321.97ms. Allocated memory was 144.7MB in the beginning and 205.5MB in the end (delta: 60.8MB). Free memory was 99.3MB in the beginning and 93.7MB in the end (delta: 5.6MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. [2024-11-09 02:15:54,645 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:15:54,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.42ms. Allocated memory is still 144.7MB. Free memory was 98.9MB in the beginning and 81.2MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 02:15:54,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.54ms. Allocated memory is still 144.7MB. Free memory was 81.2MB in the beginning and 77.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:15:54,646 INFO L158 Benchmark]: Boogie Preprocessor took 54.49ms. Allocated memory is still 144.7MB. Free memory was 77.5MB in the beginning and 74.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:15:54,647 INFO L158 Benchmark]: RCFGBuilder took 976.06ms. Allocated memory was 144.7MB in the beginning and 205.5MB in the end (delta: 60.8MB). Free memory was 74.1MB in the beginning and 156.0MB in the end (delta: -81.8MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-11-09 02:15:54,647 INFO L158 Benchmark]: TraceAbstraction took 2833.72ms. Allocated memory is still 205.5MB. Free memory was 154.9MB in the beginning and 94.8MB in the end (delta: 60.2MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-11-09 02:15:54,647 INFO L158 Benchmark]: Witness Printer took 6.22ms. Allocated memory is still 205.5MB. Free memory was 94.8MB in the beginning and 93.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:15:54,650 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.20ms. Allocated memory is still 144.7MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.42ms. Allocated memory is still 144.7MB. Free memory was 98.9MB in the beginning and 81.2MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.54ms. Allocated memory is still 144.7MB. Free memory was 81.2MB in the beginning and 77.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.49ms. Allocated memory is still 144.7MB. Free memory was 77.5MB in the beginning and 74.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 976.06ms. Allocated memory was 144.7MB in the beginning and 205.5MB in the end (delta: 60.8MB). Free memory was 74.1MB in the beginning and 156.0MB in the end (delta: -81.8MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2833.72ms. Allocated memory is still 205.5MB. Free memory was 154.9MB in the beginning and 94.8MB in the end (delta: 60.2MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * Witness Printer took 6.22ms. Allocated memory is still 205.5MB. Free memory was 94.8MB in the beginning and 93.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryArithmeticDOUBLEoperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someUnaryFLOAToperation at line 121. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1000000000.1, 1, 8.2, -32, 100.5, 25.25, 63.6, 0.0, 0.8, -8, 8, 2, 50, 0 }; [L55] float* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L57] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L58] signed long int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L59] double* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L60] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L61] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L62] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L63] double* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L64] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L65] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L66] unsigned short int* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L67] unsigned short int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L68] unsigned short int* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L69] double last_1_WrapperStruct00_var_1_9 = 100.5; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=0, last_1_WrapperStruct00_var_1_9=201/2] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_9 [L118] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L97] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L99] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L100] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L101] EXPR WrapperStruct00.var_1_4 [L101] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_4 [L101] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L102] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_12 [L103] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_12 [L103] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L103] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L104] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L105] EXPR WrapperStruct00.var_1_13 [L105] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_13 [L105] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L105] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L106] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L107] EXPR WrapperStruct00.var_1_14 [L107] EXPR WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_14 [L107] EXPR WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR (WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L108] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L109] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L110] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L111] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L112] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L113] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ushort() [L114] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L115] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L129] RET updateVariables() [L130] CALL step() [L73] COND TRUE 0.625f > last_1_WrapperStruct00_var_1_9 [L74] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L74] COND FALSE !((*(WrapperStruct00_var_1_3_Pointer))) [L80] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L80] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L81] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L82] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L82] (*(WrapperStruct00_var_1_20_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L83] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L83] COND FALSE !((*(WrapperStruct00_var_1_3_Pointer))) [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L88] COND TRUE (*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_1_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L89] (*(WrapperStruct00_var_1_9_Pointer)) = ((*(WrapperStruct00_var_1_13_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer)))) [L92] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L92] COND FALSE !((*(WrapperStruct00_var_1_4_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR (0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121] EXPR (0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121] EXPR ((0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_4_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_20_Pointer))) > (-64)) ? ((*(WrapperStruct00_var_1_20_Pointer))) : (-64))) + (((*(WrapperStruct00_var_1_20_Pointer)) + -2) + (*(WrapperStruct00_var_1_18_Pointer)))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121] EXPR (((0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_4_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_20_Pointer))) > (-64)) ? ((*(WrapperStruct00_var_1_20_Pointer))) : (-64))) + (((*(WrapperStruct00_var_1_20_Pointer)) + -2) + (*(WrapperStruct00_var_1_18_Pointer)))))) : 1)) && ((*(WrapperStruct00_var_1_3_Pointer)) ? (((*(WrapperStruct00_var_1_20_Pointer)) >= (((*(WrapperStruct00_var_1_18_Pointer)) - (*(WrapperStruct00_var_1_20_Pointer))) * 64)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((((((*(WrapperStruct00_var_1_12_Pointer))) < (50.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (50.5))) - (*(WrapperStruct00_var_1_13_Pointer))))) : 1) : (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer)))))) : 1)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121] EXPR ((((0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_4_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_20_Pointer))) > (-64)) ? ((*(WrapperStruct00_var_1_20_Pointer))) : (-64))) + (((*(WrapperStruct00_var_1_20_Pointer)) + -2) + (*(WrapperStruct00_var_1_18_Pointer)))))) : 1)) && ((*(WrapperStruct00_var_1_3_Pointer)) ? (((*(WrapperStruct00_var_1_20_Pointer)) >= (((*(WrapperStruct00_var_1_18_Pointer)) - (*(WrapperStruct00_var_1_20_Pointer))) * 64)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((((((*(WrapperStruct00_var_1_12_Pointer))) < (50.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (50.5))) - (*(WrapperStruct00_var_1_13_Pointer))))) : 1) : (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer)))))) : 1))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121] EXPR (((((0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_4_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_20_Pointer))) > (-64)) ? ((*(WrapperStruct00_var_1_20_Pointer))) : (-64))) + (((*(WrapperStruct00_var_1_20_Pointer)) + -2) + (*(WrapperStruct00_var_1_18_Pointer)))))) : 1)) && ((*(WrapperStruct00_var_1_3_Pointer)) ? (((*(WrapperStruct00_var_1_20_Pointer)) >= (((*(WrapperStruct00_var_1_18_Pointer)) - (*(WrapperStruct00_var_1_20_Pointer))) * 64)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((((((*(WrapperStruct00_var_1_12_Pointer))) < (50.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (50.5))) - (*(WrapperStruct00_var_1_13_Pointer))))) : 1) : (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer)))))) : 1))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121] EXPR ((((((0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_4_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_20_Pointer))) > (-64)) ? ((*(WrapperStruct00_var_1_20_Pointer))) : (-64))) + (((*(WrapperStruct00_var_1_20_Pointer)) + -2) + (*(WrapperStruct00_var_1_18_Pointer)))))) : 1)) && ((*(WrapperStruct00_var_1_3_Pointer)) ? (((*(WrapperStruct00_var_1_20_Pointer)) >= (((*(WrapperStruct00_var_1_18_Pointer)) - (*(WrapperStruct00_var_1_20_Pointer))) * 64)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((((((*(WrapperStruct00_var_1_12_Pointer))) < (50.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (50.5))) - (*(WrapperStruct00_var_1_13_Pointer))))) : 1) : (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer)))))) : 1))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L121-L122] return ((((((0.625f > last_1_WrapperStruct00_var_1_9) ? ((*(WrapperStruct00_var_1_3_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_4_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_20_Pointer))) > (-64)) ? ((*(WrapperStruct00_var_1_20_Pointer))) : (-64))) + (((*(WrapperStruct00_var_1_20_Pointer)) + -2) + (*(WrapperStruct00_var_1_18_Pointer)))))) : 1)) && ((*(WrapperStruct00_var_1_3_Pointer)) ? (((*(WrapperStruct00_var_1_20_Pointer)) >= (((*(WrapperStruct00_var_1_18_Pointer)) - (*(WrapperStruct00_var_1_20_Pointer))) * 64)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((((((*(WrapperStruct00_var_1_12_Pointer))) < (50.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (50.5))) - (*(WrapperStruct00_var_1_13_Pointer))))) : 1) : (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer)))))) : 1))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:21}, WrapperStruct00_var_1_13_Pointer={4:29}, WrapperStruct00_var_1_14_Pointer={4:37}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:54}, WrapperStruct00_var_1_18_Pointer={4:55}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:59}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 6, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 2555 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1786 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 769 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=5, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 555 ConstructedInterpolants, 0 QuantifiedInterpolants, 571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1100/1100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 02:15:54,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1a2bcd66d87d7ad4b83fe3db6aada8f59760a9add58b963015dd7d640f76e7f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:15:56,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:15:56,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 02:15:56,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:15:56,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:15:57,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:15:57,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:15:57,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:15:57,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:15:57,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:15:57,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:15:57,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:15:57,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:15:57,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:15:57,038 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:15:57,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:15:57,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:15:57,039 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:15:57,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:15:57,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:15:57,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:15:57,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:15:57,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:15:57,044 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 02:15:57,044 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 02:15:57,044 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:15:57,045 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 02:15:57,045 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:15:57,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:15:57,045 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:15:57,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:15:57,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:15:57,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:15:57,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:15:57,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:15:57,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:15:57,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:15:57,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:15:57,048 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 02:15:57,048 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 02:15:57,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:15:57,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:15:57,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:15:57,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:15:57,050 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1a2bcd66d87d7ad4b83fe3db6aada8f59760a9add58b963015dd7d640f76e7f [2024-11-09 02:15:57,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:15:57,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:15:57,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:15:57,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:15:57,409 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:15:57,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i [2024-11-09 02:15:58,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:15:59,235 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:15:59,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i [2024-11-09 02:15:59,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e39106f12/29b3931904f04c7dbb6d0946e7197d78/FLAG1be50843b [2024-11-09 02:15:59,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e39106f12/29b3931904f04c7dbb6d0946e7197d78 [2024-11-09 02:15:59,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:15:59,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:15:59,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:15:59,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:15:59,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:15:59,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:15:59" (1/1) ... [2024-11-09 02:15:59,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6757be2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59, skipping insertion in model container [2024-11-09 02:15:59,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:15:59" (1/1) ... [2024-11-09 02:15:59,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:15:59,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i[917,930] [2024-11-09 02:15:59,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:15:59,680 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:15:59,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-65.i[917,930] [2024-11-09 02:15:59,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:15:59,780 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:15:59,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59 WrapperNode [2024-11-09 02:15:59,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:15:59,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:15:59,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:15:59,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:15:59,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59" (1/1) ... [2024-11-09 02:15:59,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59" (1/1) ... [2024-11-09 02:15:59,867 INFO L138 Inliner]: procedures = 40, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 494 [2024-11-09 02:15:59,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:15:59,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:15:59,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:15:59,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:15:59,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59" (1/1) ... [2024-11-09 02:15:59,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59" (1/1) ... [2024-11-09 02:15:59,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59" (1/1) ... [2024-11-09 02:15:59,944 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-09 02:15:59,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59" (1/1) ... [2024-11-09 02:15:59,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59" (1/1) ... [2024-11-09 02:15:59,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59" (1/1) ... [2024-11-09 02:15:59,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59" (1/1) ... [2024-11-09 02:15:59,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59" (1/1) ... [2024-11-09 02:15:59,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59" (1/1) ... [2024-11-09 02:15:59,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:15:59,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:15:59,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:15:59,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:15:59,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59" (1/1) ... [2024-11-09 02:15:59,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:16:00,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:16:00,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:16:00,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:16:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:16:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 02:16:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 02:16:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-09 02:16:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-09 02:16:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 02:16:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 02:16:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 02:16:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 02:16:00,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 02:16:00,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 02:16:00,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 02:16:00,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 02:16:00,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 02:16:00,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 02:16:00,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 02:16:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 02:16:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-09 02:16:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-09 02:16:00,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 02:16:00,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 02:16:00,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-09 02:16:00,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-09 02:16:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 02:16:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 02:16:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:16:00,075 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:16:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-09 02:16:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-09 02:16:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:16:00,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:16:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 02:16:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 02:16:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 02:16:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 02:16:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 02:16:00,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 02:16:00,264 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:16:00,266 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:16:05,292 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-09 02:16:05,293 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:16:05,313 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:16:05,313 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:16:05,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:16:05 BoogieIcfgContainer [2024-11-09 02:16:05,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:16:05,318 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:16:05,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:16:05,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:16:05,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:15:59" (1/3) ... [2024-11-09 02:16:05,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119c68ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:16:05, skipping insertion in model container [2024-11-09 02:16:05,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:59" (2/3) ... [2024-11-09 02:16:05,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119c68ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:16:05, skipping insertion in model container [2024-11-09 02:16:05,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:16:05" (3/3) ... [2024-11-09 02:16:05,326 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-65.i [2024-11-09 02:16:05,342 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:16:05,343 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:16:05,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:16:05,408 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;@787df569, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:16:05,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:16:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:16:05,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 02:16:05,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:05,430 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:05,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:05,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:05,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1938011596, now seen corresponding path program 1 times [2024-11-09 02:16:05,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:05,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474285895] [2024-11-09 02:16:05,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:05,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:05,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:05,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:16:05,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 02:16:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:06,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 02:16:06,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 02:16:06,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:06,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:06,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474285895] [2024-11-09 02:16:06,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474285895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:06,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:06,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:16:06,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138340376] [2024-11-09 02:16:06,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:06,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:16:06,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:06,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:16:06,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:16:06,151 INFO L87 Difference]: Start difference. First operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 02:16:06,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:06,182 INFO L93 Difference]: Finished difference Result 219 states and 337 transitions. [2024-11-09 02:16:06,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:16:06,184 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-09 02:16:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:06,191 INFO L225 Difference]: With dead ends: 219 [2024-11-09 02:16:06,191 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 02:16:06,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:16:06,197 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:06,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:16:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 02:16:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-09 02:16:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:16:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-09 02:16:06,244 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 112 [2024-11-09 02:16:06,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:06,244 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-09 02:16:06,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 02:16:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-09 02:16:06,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 02:16:06,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:06,248 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:06,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 02:16:06,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:06,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:06,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:06,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1962849030, now seen corresponding path program 1 times [2024-11-09 02:16:06,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:06,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386457789] [2024-11-09 02:16:06,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:06,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:06,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:06,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:16:06,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 02:16:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:06,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:16:06,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 02:16:07,006 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:07,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:07,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386457789] [2024-11-09 02:16:07,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386457789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:07,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:07,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:16:07,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357587739] [2024-11-09 02:16:07,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:07,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:16:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:07,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:16:07,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:16:07,010 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 02:16:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:07,089 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2024-11-09 02:16:07,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:16:07,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-09 02:16:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:07,094 INFO L225 Difference]: With dead ends: 217 [2024-11-09 02:16:07,094 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 02:16:07,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:16:07,096 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:07,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:16:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 02:16:07,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 02:16:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:16:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-09 02:16:07,122 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 112 [2024-11-09 02:16:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:07,123 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-09 02:16:07,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 02:16:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-09 02:16:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 02:16:07,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:07,130 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:07,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 02:16:07,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:07,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:07,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:07,333 INFO L85 PathProgramCache]: Analyzing trace with hash 611463812, now seen corresponding path program 1 times [2024-11-09 02:16:07,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:07,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059332718] [2024-11-09 02:16:07,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:07,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:07,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:07,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:16:07,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 02:16:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:07,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:16:07,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 02:16:07,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:07,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:07,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059332718] [2024-11-09 02:16:07,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059332718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:07,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:07,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:16:07,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574433006] [2024-11-09 02:16:07,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:07,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:16:07,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:07,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:16:07,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:16:07,947 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:16:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:08,015 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-09 02:16:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:16:08,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-09 02:16:08,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:08,018 INFO L225 Difference]: With dead ends: 222 [2024-11-09 02:16:08,018 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 02:16:08,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 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-11-09 02:16:08,020 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:08,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:16:08,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 02:16:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-09 02:16:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:16:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-09 02:16:08,039 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 112 [2024-11-09 02:16:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:08,039 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-09 02:16:08,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:16:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-09 02:16:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 02:16:08,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:08,042 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:08,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 02:16:08,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:08,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:08,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2101092362, now seen corresponding path program 1 times [2024-11-09 02:16:08,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:08,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694092227] [2024-11-09 02:16:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:08,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-11-09 02:16:08,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:08,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:16:08,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 02:16:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:08,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 02:16:08,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 02:16:08,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:08,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:08,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694092227] [2024-11-09 02:16:08,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694092227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:08,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:08,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:16:08,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250308598] [2024-11-09 02:16:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:08,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:16:08,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:08,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:16:08,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:16:08,858 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:16:11,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:16:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:15,240 INFO L93 Difference]: Finished difference Result 266 states and 378 transitions. [2024-11-09 02:16:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:16:15,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-09 02:16:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:15,243 INFO L225 Difference]: With dead ends: 266 [2024-11-09 02:16:15,243 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 02:16:15,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 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-11-09 02:16:15,245 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 59 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:15,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 276 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-09 02:16:15,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 02:16:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2024-11-09 02:16:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 113 states have internal predecessors, (157), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:16:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 179 transitions. [2024-11-09 02:16:15,254 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 179 transitions. Word has length 112 [2024-11-09 02:16:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:15,254 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 179 transitions. [2024-11-09 02:16:15,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:16:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 179 transitions. [2024-11-09 02:16:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 02:16:15,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:15,257 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:15,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 02:16:15,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:15,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:15,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:15,458 INFO L85 PathProgramCache]: Analyzing trace with hash -726119745, now seen corresponding path program 1 times [2024-11-09 02:16:15,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:15,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101146614] [2024-11-09 02:16:15,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:15,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:15,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:15,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:16:15,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 02:16:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:15,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:16:16,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 02:16:16,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:16,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:16,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101146614] [2024-11-09 02:16:16,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101146614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:16,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:16,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:16:16,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723738828] [2024-11-09 02:16:16,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:16,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:16:16,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:16,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:16:16,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:16:16,041 INFO L87 Difference]: Start difference. First operand 126 states and 179 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:16:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:16,115 INFO L93 Difference]: Finished difference Result 254 states and 362 transitions. [2024-11-09 02:16:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:16:16,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2024-11-09 02:16:16,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:16,118 INFO L225 Difference]: With dead ends: 254 [2024-11-09 02:16:16,118 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 02:16:16,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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-11-09 02:16:16,121 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:16,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 592 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:16:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 02:16:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-09 02:16:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.376068376068376) internal successors, (161), 117 states have internal predecessors, (161), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:16:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 183 transitions. [2024-11-09 02:16:16,134 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 183 transitions. Word has length 113 [2024-11-09 02:16:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:16,134 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 183 transitions. [2024-11-09 02:16:16,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:16:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 183 transitions. [2024-11-09 02:16:16,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 02:16:16,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:16,140 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:16,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 02:16:16,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:16,341 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:16,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash -46061375, now seen corresponding path program 1 times [2024-11-09 02:16:16,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:16,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543603304] [2024-11-09 02:16:16,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:16,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:16,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:16,344 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:16:16,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 02:16:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:16,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 02:16:16,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 02:16:16,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:16,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:16,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543603304] [2024-11-09 02:16:16,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543603304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:16,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:16,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:16:16,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806498554] [2024-11-09 02:16:16,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:16,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:16:16,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:16,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:16:16,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:16:16,922 INFO L87 Difference]: Start difference. First operand 130 states and 183 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:16:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:17,001 INFO L93 Difference]: Finished difference Result 260 states and 367 transitions. [2024-11-09 02:16:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:16:17,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2024-11-09 02:16:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:17,007 INFO L225 Difference]: With dead ends: 260 [2024-11-09 02:16:17,007 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 02:16:17,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:16:17,009 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:17,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 730 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:16:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 02:16:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2024-11-09 02:16:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 119 states have internal predecessors, (163), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:16:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 185 transitions. [2024-11-09 02:16:17,020 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 185 transitions. Word has length 113 [2024-11-09 02:16:17,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:17,020 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 185 transitions. [2024-11-09 02:16:17,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:16:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 185 transitions. [2024-11-09 02:16:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 02:16:17,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:17,023 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:17,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 02:16:17,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:17,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:17,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:17,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1728945987, now seen corresponding path program 1 times [2024-11-09 02:16:17,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:17,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179635182] [2024-11-09 02:16:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:17,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:17,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:17,226 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:16:17,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 02:16:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:17,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 02:16:17,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 02:16:17,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:17,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:17,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179635182] [2024-11-09 02:16:17,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179635182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:17,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:17,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:16:17,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461574519] [2024-11-09 02:16:17,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:17,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:16:17,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:17,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:16:17,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:16:17,766 INFO L87 Difference]: Start difference. First operand 132 states and 185 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:16:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:17,857 INFO L93 Difference]: Finished difference Result 264 states and 371 transitions. [2024-11-09 02:16:17,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:16:17,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2024-11-09 02:16:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:17,859 INFO L225 Difference]: With dead ends: 264 [2024-11-09 02:16:17,860 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 02:16:17,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:16:17,861 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:17,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 869 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:16:17,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 02:16:17,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-09 02:16:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 121 states have internal predecessors, (165), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:16:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2024-11-09 02:16:17,868 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 113 [2024-11-09 02:16:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:17,869 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2024-11-09 02:16:17,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 02:16:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2024-11-09 02:16:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 02:16:17,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:17,871 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:17,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 02:16:18,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:18,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:18,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:18,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1730793029, now seen corresponding path program 1 times [2024-11-09 02:16:18,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:18,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713981605] [2024-11-09 02:16:18,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:18,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:18,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:18,074 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:16:18,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 02:16:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:16:18,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:18,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:16:18,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-09 02:16:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 02:16:18,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:18,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:18,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713981605] [2024-11-09 02:16:18,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713981605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:18,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:18,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:16:18,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693022396] [2024-11-09 02:16:18,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:18,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:16:18,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:18,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:16:18,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:16:18,775 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 02:16:21,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:16:25,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:16:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:25,369 INFO L93 Difference]: Finished difference Result 266 states and 372 transitions. [2024-11-09 02:16:25,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:16:25,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2024-11-09 02:16:25,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:25,370 INFO L225 Difference]: With dead ends: 266 [2024-11-09 02:16:25,370 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 02:16:25,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:16:25,372 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 136 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:25,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 383 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-09 02:16:25,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 02:16:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-09 02:16:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 121 states have internal predecessors, (164), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:16:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 186 transitions. [2024-11-09 02:16:25,383 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 186 transitions. Word has length 113 [2024-11-09 02:16:25,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:25,383 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 186 transitions. [2024-11-09 02:16:25,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 02:16:25,384 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 186 transitions. [2024-11-09 02:16:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 02:16:25,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:25,385 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:25,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 02:16:25,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:25,586 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:25,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:25,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1067335157, now seen corresponding path program 1 times [2024-11-09 02:16:25,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:25,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591772703] [2024-11-09 02:16:25,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:25,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:25,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:25,588 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:16:25,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 02:16:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:26,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:16:26,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:26,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:16:26,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-09 02:16:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-09 02:16:26,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:26,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:26,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591772703] [2024-11-09 02:16:26,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591772703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:26,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:26,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:16:26,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464698698] [2024-11-09 02:16:26,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:26,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:16:26,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:26,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:16:26,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:16:26,288 INFO L87 Difference]: Start difference. First operand 134 states and 186 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 02:16:30,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:16:34,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:34,245 INFO L93 Difference]: Finished difference Result 266 states and 370 transitions. [2024-11-09 02:16:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:16:34,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2024-11-09 02:16:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:34,246 INFO L225 Difference]: With dead ends: 266 [2024-11-09 02:16:34,246 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 02:16:34,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:16:34,247 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 128 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:34,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 379 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2024-11-09 02:16:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 02:16:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-09 02:16:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 121 states have internal predecessors, (163), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:16:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 185 transitions. [2024-11-09 02:16:34,253 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 185 transitions. Word has length 115 [2024-11-09 02:16:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:34,253 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 185 transitions. [2024-11-09 02:16:34,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 02:16:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 185 transitions. [2024-11-09 02:16:34,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 02:16:34,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:34,255 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:34,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 02:16:34,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:34,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:34,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:34,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1095146373, now seen corresponding path program 1 times [2024-11-09 02:16:34,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:34,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209795413] [2024-11-09 02:16:34,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:34,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:34,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:34,458 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:16:34,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 02:16:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:34,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:16:34,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:35,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:16:35,146 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 175 treesize of output 67 [2024-11-09 02:16:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 02:16:35,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:35,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:35,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209795413] [2024-11-09 02:16:35,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209795413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:35,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:35,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:16:35,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073365004] [2024-11-09 02:16:35,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:35,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:16:35,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:35,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:16:35,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:16:35,184 INFO L87 Difference]: Start difference. First operand 134 states and 185 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 02:16:38,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:16:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:41,465 INFO L93 Difference]: Finished difference Result 266 states and 368 transitions. [2024-11-09 02:16:41,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:16:41,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2024-11-09 02:16:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:41,467 INFO L225 Difference]: With dead ends: 266 [2024-11-09 02:16:41,467 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 02:16:41,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:16:41,468 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 119 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:41,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 375 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-09 02:16:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 02:16:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-09 02:16:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3388429752066116) internal successors, (162), 121 states have internal predecessors, (162), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:16:41,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 184 transitions. [2024-11-09 02:16:41,475 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 184 transitions. Word has length 117 [2024-11-09 02:16:41,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:41,477 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 184 transitions. [2024-11-09 02:16:41,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 02:16:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 184 transitions. [2024-11-09 02:16:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 02:16:41,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:41,478 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:41,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 02:16:41,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:41,679 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:41,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:41,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1385705141, now seen corresponding path program 1 times [2024-11-09 02:16:41,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:41,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001448977] [2024-11-09 02:16:41,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:41,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:41,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:41,682 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:16:41,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 02:16:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:42,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:16:42,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:42,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:16:42,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-11-09 02:16:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 02:16:42,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:42,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:42,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001448977] [2024-11-09 02:16:42,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001448977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:42,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:42,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:16:42,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809810446] [2024-11-09 02:16:42,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:42,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:16:42,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:42,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:16:42,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:16:42,445 INFO L87 Difference]: Start difference. First operand 134 states and 184 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 02:16:44,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:16:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:47,936 INFO L93 Difference]: Finished difference Result 266 states and 366 transitions. [2024-11-09 02:16:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:16:47,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 119 [2024-11-09 02:16:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:47,937 INFO L225 Difference]: With dead ends: 266 [2024-11-09 02:16:47,938 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 02:16:47,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:16:47,938 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 110 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:47,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 369 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-09 02:16:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 02:16:47,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-09 02:16:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3305785123966942) internal successors, (161), 121 states have internal predecessors, (161), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 02:16:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 183 transitions. [2024-11-09 02:16:47,943 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 183 transitions. Word has length 119 [2024-11-09 02:16:47,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:47,943 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 183 transitions. [2024-11-09 02:16:47,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 02:16:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 183 transitions. [2024-11-09 02:16:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 02:16:47,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:47,945 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:47,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 02:16:48,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:48,146 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:48,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:48,146 INFO L85 PathProgramCache]: Analyzing trace with hash -993789755, now seen corresponding path program 1 times [2024-11-09 02:16:48,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:48,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034871280] [2024-11-09 02:16:48,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:48,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:16:48,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:48,148 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:16:48,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 02:16:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 02:16:48,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:50,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 02:16:52,145 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 44 treesize of output 28 [2024-11-09 02:16:56,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2024-11-09 02:17:05,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 69 [2024-11-09 02:17:18,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 91