./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.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_fillercode_fillercodestructure_filler-ps-ci_file-7.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 2443bff004680acf9358dc6eb7b3ebb2c0abce0266843d4c0b3809d4105241e0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:18:41,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:18:41,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:18:41,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:18:41,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:18:41,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:18:41,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:18:41,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:18:41,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:18:41,459 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:18:41,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:18:41,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:18:41,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:18:41,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:18:41,461 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:18:41,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:18:41,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:18:41,464 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:18:41,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:18:41,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:18:41,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:18:41,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:18:41,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:18:41,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:18:41,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:18:41,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:18:41,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:18:41,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:18:41,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:18:41,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:18:41,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:18:41,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:18:41,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:18:41,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:18:41,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:18:41,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:18:41,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:18:41,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:18:41,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:18:41,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:18:41,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:18:41,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:18:41,475 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 -> 2443bff004680acf9358dc6eb7b3ebb2c0abce0266843d4c0b3809d4105241e0 [2024-11-08 22:18:41,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:18:41,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:18:41,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:18:41,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:18:41,675 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:18:41,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i [2024-11-08 22:18:43,060 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:18:43,236 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:18:43,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i [2024-11-08 22:18:43,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94eab10f/8e6321c4d0e3418b9beeb4443f70ff5c/FLAGf26b9d86e [2024-11-08 22:18:43,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94eab10f/8e6321c4d0e3418b9beeb4443f70ff5c [2024-11-08 22:18:43,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:18:43,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:18:43,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:18:43,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:18:43,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:18:43,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:18:43" (1/1) ... [2024-11-08 22:18:43,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47804ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43, skipping insertion in model container [2024-11-08 22:18:43,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:18:43" (1/1) ... [2024-11-08 22:18:43,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:18:43,445 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_fillercode_fillercodestructure_filler-ps-ci_file-7.i[918,931] [2024-11-08 22:18:43,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:18:43,561 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:18:43,570 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_fillercode_fillercodestructure_filler-ps-ci_file-7.i[918,931] [2024-11-08 22:18:43,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:18:43,617 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:18:43,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43 WrapperNode [2024-11-08 22:18:43,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:18:43,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:18:43,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:18:43,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:18:43,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43" (1/1) ... [2024-11-08 22:18:43,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43" (1/1) ... [2024-11-08 22:18:43,668 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 274 [2024-11-08 22:18:43,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:18:43,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:18:43,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:18:43,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:18:43,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43" (1/1) ... [2024-11-08 22:18:43,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43" (1/1) ... [2024-11-08 22:18:43,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43" (1/1) ... [2024-11-08 22:18:43,700 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:18:43,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43" (1/1) ... [2024-11-08 22:18:43,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43" (1/1) ... [2024-11-08 22:18:43,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43" (1/1) ... [2024-11-08 22:18:43,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43" (1/1) ... [2024-11-08 22:18:43,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43" (1/1) ... [2024-11-08 22:18:43,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43" (1/1) ... [2024-11-08 22:18:43,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:18:43,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:18:43,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:18:43,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:18:43,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43" (1/1) ... [2024-11-08 22:18:43,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:18:43,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:18:43,758 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-08 22:18:43,761 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-08 22:18:43,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:18:43,793 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:18:43,793 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:18:43,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:18:43,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:18:43,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:18:43,884 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:18:43,886 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:18:44,266 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 22:18:44,267 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:18:44,279 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:18:44,279 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:18:44,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:18:44 BoogieIcfgContainer [2024-11-08 22:18:44,279 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:18:44,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:18:44,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:18:44,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:18:44,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:18:43" (1/3) ... [2024-11-08 22:18:44,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140f138c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:18:44, skipping insertion in model container [2024-11-08 22:18:44,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:43" (2/3) ... [2024-11-08 22:18:44,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140f138c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:18:44, skipping insertion in model container [2024-11-08 22:18:44,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:18:44" (3/3) ... [2024-11-08 22:18:44,285 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i [2024-11-08 22:18:44,297 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:18:44,297 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:18:44,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:18:44,352 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;@387aa778, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:18:44,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:18:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 22:18:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 22:18:44,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:44,368 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:18:44,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:44,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1404036116, now seen corresponding path program 1 times [2024-11-08 22:18:44,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:18:44,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267959069] [2024-11-08 22:18:44,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:44,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:18:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:18:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:18:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:18:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 22:18:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:18:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:18:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:18:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:18:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:18:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:18:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:18:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:18:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:18:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:18:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:18:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:18:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:18:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:18:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:18:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:18:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:18:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 22:18:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 22:18:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 22:18:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 22:18:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 22:18:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 22:18:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 22:18:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 22:18:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 22:18:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 22:18:44,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:18:44,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267959069] [2024-11-08 22:18:44,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267959069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:44,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:44,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:18:44,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407645421] [2024-11-08 22:18:44,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:44,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:18:44,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:18:44,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:18:44,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:18:44,806 INFO L87 Difference]: Start difference. First operand has 115 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 22:18:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:44,839 INFO L93 Difference]: Finished difference Result 219 states and 378 transitions. [2024-11-08 22:18:44,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:18:44,841 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 200 [2024-11-08 22:18:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:44,848 INFO L225 Difference]: With dead ends: 219 [2024-11-08 22:18:44,848 INFO L226 Difference]: Without dead ends: 107 [2024-11-08 22:18:44,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-08 22:18:44,855 INFO L432 NwaCegarLoop]: 165 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, 165 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-08 22:18:44,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:18:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-08 22:18:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-08 22:18:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 22:18:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 165 transitions. [2024-11-08 22:18:44,893 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 165 transitions. Word has length 200 [2024-11-08 22:18:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:44,894 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 165 transitions. [2024-11-08 22:18:44,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 22:18:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 165 transitions. [2024-11-08 22:18:44,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 22:18:44,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:44,898 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:18:44,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:18:44,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:44,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:44,899 INFO L85 PathProgramCache]: Analyzing trace with hash -401498968, now seen corresponding path program 1 times [2024-11-08 22:18:44,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:18:44,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667496384] [2024-11-08 22:18:44,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:44,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:18:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:18:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:18:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:18:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 22:18:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:18:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:18:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:18:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:18:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:18:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:18:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:18:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:18:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:18:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:18:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:18:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:18:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:18:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:18:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:18:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:18:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:18:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 22:18:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 22:18:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 22:18:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 22:18:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 22:18:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 22:18:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 22:18:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 22:18:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 22:18:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 22:18:45,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:18:45,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667496384] [2024-11-08 22:18:45,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667496384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:45,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:45,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:18:45,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888383045] [2024-11-08 22:18:45,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:45,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:18:45,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:18:45,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:18:45,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:18:45,242 INFO L87 Difference]: Start difference. First operand 107 states and 165 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 22:18:45,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:45,305 INFO L93 Difference]: Finished difference Result 212 states and 329 transitions. [2024-11-08 22:18:45,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:18:45,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-11-08 22:18:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:45,308 INFO L225 Difference]: With dead ends: 212 [2024-11-08 22:18:45,309 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 22:18:45,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 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-08 22:18:45,310 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:45,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 470 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:18:45,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 22:18:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-08 22:18:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 76 states have (on average 1.394736842105263) internal successors, (106), 76 states have internal predecessors, (106), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 22:18:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 166 transitions. [2024-11-08 22:18:45,323 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 166 transitions. Word has length 200 [2024-11-08 22:18:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:45,328 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 166 transitions. [2024-11-08 22:18:45,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 22:18:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 166 transitions. [2024-11-08 22:18:45,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-08 22:18:45,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:45,335 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:18:45,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:18:45,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:45,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:45,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1768868040, now seen corresponding path program 1 times [2024-11-08 22:18:45,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:18:45,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156976630] [2024-11-08 22:18:45,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:45,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:18:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:18:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:18:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:18:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 22:18:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:18:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:18:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:18:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:18:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:18:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:18:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:18:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:18:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:18:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:18:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:18:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:18:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:18:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:18:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:18:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:18:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:18:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 22:18:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 22:18:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 22:18:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 22:18:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 22:18:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 22:18:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 22:18:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 22:18:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 22:18:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 22:18:45,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:18:45,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156976630] [2024-11-08 22:18:45,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156976630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:45,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:45,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:18:45,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053592063] [2024-11-08 22:18:45,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:45,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:18:45,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:18:45,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:18:45,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:18:45,580 INFO L87 Difference]: Start difference. First operand 108 states and 166 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 22:18:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:45,691 INFO L93 Difference]: Finished difference Result 247 states and 377 transitions. [2024-11-08 22:18:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:18:45,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 201 [2024-11-08 22:18:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:45,694 INFO L225 Difference]: With dead ends: 247 [2024-11-08 22:18:45,694 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 22:18:45,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:18:45,696 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 45 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:45,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 523 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:18:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 22:18:45,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-08 22:18:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 101 states have (on average 1.396039603960396) internal successors, (141), 102 states have internal predecessors, (141), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-08 22:18:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 211 transitions. [2024-11-08 22:18:45,714 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 211 transitions. Word has length 201 [2024-11-08 22:18:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:45,714 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 211 transitions. [2024-11-08 22:18:45,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 22:18:45,715 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2024-11-08 22:18:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 22:18:45,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:45,717 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:18:45,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:18:45,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:45,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:45,717 INFO L85 PathProgramCache]: Analyzing trace with hash -291429079, now seen corresponding path program 1 times [2024-11-08 22:18:45,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:18:45,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788822231] [2024-11-08 22:18:45,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:45,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:18:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:18:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:18:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:18:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 22:18:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:18:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:18:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:18:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:18:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:18:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:18:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:18:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:18:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:18:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:18:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:18:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:18:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:18:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:18:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:18:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:18:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:18:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 22:18:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 22:18:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 22:18:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 22:18:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 22:18:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 22:18:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 22:18:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 22:18:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 22:18:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 22:18:46,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:18:46,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788822231] [2024-11-08 22:18:46,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788822231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:46,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:46,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:18:46,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578651023] [2024-11-08 22:18:46,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:46,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:18:46,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:18:46,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:18:46,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:18:46,030 INFO L87 Difference]: Start difference. First operand 139 states and 211 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 22:18:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:46,068 INFO L93 Difference]: Finished difference Result 411 states and 627 transitions. [2024-11-08 22:18:46,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:18:46,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 202 [2024-11-08 22:18:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:46,072 INFO L225 Difference]: With dead ends: 411 [2024-11-08 22:18:46,072 INFO L226 Difference]: Without dead ends: 275 [2024-11-08 22:18:46,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-08 22:18:46,077 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 107 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:46,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 309 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:18:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-08 22:18:46,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2024-11-08 22:18:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 198 states have (on average 1.398989898989899) internal successors, (277), 200 states have internal predecessors, (277), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 22:18:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 417 transitions. [2024-11-08 22:18:46,116 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 417 transitions. Word has length 202 [2024-11-08 22:18:46,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:46,116 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 417 transitions. [2024-11-08 22:18:46,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 22:18:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 417 transitions. [2024-11-08 22:18:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 22:18:46,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:46,119 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:18:46,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:18:46,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:46,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:46,120 INFO L85 PathProgramCache]: Analyzing trace with hash 646205962, now seen corresponding path program 1 times [2024-11-08 22:18:46,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:18:46,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280955746] [2024-11-08 22:18:46,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:46,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:18:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:18:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:18:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:18:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 22:18:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:18:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:18:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:18:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:18:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:18:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:18:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:18:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:18:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:18:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:18:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:18:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:18:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:18:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:18:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:18:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:18:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:18:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 22:18:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 22:18:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 22:18:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 22:18:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 22:18:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 22:18:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 22:18:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 22:18:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 22:18:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 22:18:46,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:18:46,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280955746] [2024-11-08 22:18:46,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280955746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:46,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:46,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 22:18:46,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678874228] [2024-11-08 22:18:46,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:46,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 22:18:46,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:18:46,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 22:18:46,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 22:18:46,385 INFO L87 Difference]: Start difference. First operand 273 states and 417 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 22:18:46,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:46,561 INFO L93 Difference]: Finished difference Result 705 states and 1075 transitions. [2024-11-08 22:18:46,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 22:18:46,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 203 [2024-11-08 22:18:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:46,568 INFO L225 Difference]: With dead ends: 705 [2024-11-08 22:18:46,568 INFO L226 Difference]: Without dead ends: 435 [2024-11-08 22:18:46,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 22:18:46,570 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 98 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:46,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 550 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:18:46,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-08 22:18:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 427. [2024-11-08 22:18:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 336 states have (on average 1.4464285714285714) internal successors, (486), 342 states have internal predecessors, (486), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 76 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-08 22:18:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 650 transitions. [2024-11-08 22:18:46,637 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 650 transitions. Word has length 203 [2024-11-08 22:18:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:46,639 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 650 transitions. [2024-11-08 22:18:46,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 22:18:46,640 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 650 transitions. [2024-11-08 22:18:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 22:18:46,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:46,641 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:18:46,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 22:18:46,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:46,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:46,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1958294693, now seen corresponding path program 1 times [2024-11-08 22:18:46,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:18:46,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660861266] [2024-11-08 22:18:46,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:46,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:18:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:18:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:18:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:18:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 22:18:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:18:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:18:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:18:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:18:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:18:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:18:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:18:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:18:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:18:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:18:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:18:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:18:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:18:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:18:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:18:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:18:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:18:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 22:18:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 22:18:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 22:18:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 22:18:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 22:18:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 22:18:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 22:18:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 22:18:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 22:18:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 22:18:46,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:18:46,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660861266] [2024-11-08 22:18:46,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660861266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:46,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:46,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:18:46,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749944387] [2024-11-08 22:18:46,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:46,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:18:46,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:18:46,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:18:46,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:18:46,815 INFO L87 Difference]: Start difference. First operand 427 states and 650 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 22:18:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:46,957 INFO L93 Difference]: Finished difference Result 1047 states and 1569 transitions. [2024-11-08 22:18:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:18:46,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 204 [2024-11-08 22:18:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:46,963 INFO L225 Difference]: With dead ends: 1047 [2024-11-08 22:18:46,964 INFO L226 Difference]: Without dead ends: 605 [2024-11-08 22:18:46,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:18:46,966 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 136 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:46,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 473 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:18:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-08 22:18:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 399. [2024-11-08 22:18:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 320 states have (on average 1.4375) internal successors, (460), 322 states have internal predecessors, (460), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 22:18:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 600 transitions. [2024-11-08 22:18:47,003 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 600 transitions. Word has length 204 [2024-11-08 22:18:47,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:47,003 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 600 transitions. [2024-11-08 22:18:47,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 22:18:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 600 transitions. [2024-11-08 22:18:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 22:18:47,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:47,005 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:18:47,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 22:18:47,006 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:47,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:47,006 INFO L85 PathProgramCache]: Analyzing trace with hash 658025598, now seen corresponding path program 1 times [2024-11-08 22:18:47,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:18:47,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637674499] [2024-11-08 22:18:47,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:47,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:18:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:18:47,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:18:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:18:47,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:18:47,234 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:18:47,235 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:18:47,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:18:47,240 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:47,365 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:18:47,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:18:47 BoogieIcfgContainer [2024-11-08 22:18:47,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:18:47,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:18:47,368 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:18:47,368 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:18:47,368 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:18:44" (3/4) ... [2024-11-08 22:18:47,371 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:18:47,372 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:18:47,373 INFO L158 Benchmark]: Toolchain (without parser) took 4110.78ms. Allocated memory was 199.2MB in the beginning and 312.5MB in the end (delta: 113.2MB). Free memory was 149.7MB in the beginning and 260.1MB in the end (delta: -110.5MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-11-08 22:18:47,373 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory was 68.5MB in the beginning and 68.4MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:18:47,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.76ms. Allocated memory is still 199.2MB. Free memory was 149.1MB in the beginning and 163.5MB in the end (delta: -14.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 22:18:47,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.02ms. Allocated memory is still 199.2MB. Free memory was 163.5MB in the beginning and 158.6MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:18:47,374 INFO L158 Benchmark]: Boogie Preprocessor took 49.24ms. Allocated memory is still 199.2MB. Free memory was 158.6MB in the beginning and 153.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:18:47,374 INFO L158 Benchmark]: RCFGBuilder took 560.25ms. Allocated memory is still 199.2MB. Free memory was 153.7MB in the beginning and 122.9MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 22:18:47,374 INFO L158 Benchmark]: TraceAbstraction took 3086.35ms. Allocated memory was 199.2MB in the beginning and 312.5MB in the end (delta: 113.2MB). Free memory was 122.3MB in the beginning and 261.1MB in the end (delta: -138.8MB). Peak memory consumption was 146.6MB. Max. memory is 16.1GB. [2024-11-08 22:18:47,375 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 312.5MB. Free memory was 261.1MB in the beginning and 260.1MB in the end (delta: 972.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:18:47,376 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.14ms. Allocated memory is still 109.1MB. Free memory was 68.5MB in the beginning and 68.4MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.76ms. Allocated memory is still 199.2MB. Free memory was 149.1MB in the beginning and 163.5MB in the end (delta: -14.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.02ms. Allocated memory is still 199.2MB. Free memory was 163.5MB in the beginning and 158.6MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.24ms. Allocated memory is still 199.2MB. Free memory was 158.6MB in the beginning and 153.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 560.25ms. Allocated memory is still 199.2MB. Free memory was 153.7MB in the beginning and 122.9MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3086.35ms. Allocated memory was 199.2MB in the beginning and 312.5MB in the end (delta: 113.2MB). Free memory was 122.3MB in the beginning and 261.1MB in the end (delta: -138.8MB). Peak memory consumption was 146.6MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 312.5MB. Free memory was 261.1MB in the beginning and 260.1MB in the end (delta: 972.8kB). 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 181, overapproximation of someBinaryArithmeticFLOAToperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] float var_1_2 = 200.875; [L24] float var_1_3 = 100.25; [L25] float var_1_4 = 99999999.34; [L26] unsigned short int var_1_5 = 10; [L27] unsigned short int var_1_6 = 8; [L28] unsigned long int var_1_7 = 25; [L29] unsigned char var_1_8 = 0; [L30] signed long int var_1_9 = -16; [L31] unsigned short int var_1_10 = 25; [L32] unsigned short int var_1_11 = 10000; [L33] signed short int var_1_12 = -32; [L34] signed char var_1_13 = 4; [L35] signed char var_1_14 = 25; [L36] signed short int var_1_15 = -16; [L37] signed short int var_1_16 = 100; [L38] signed short int var_1_17 = 8; [L39] float var_1_18 = 5.8; [L40] float var_1_19 = 0.19999999999999996; [L41] float var_1_20 = 1.5; [L42] float var_1_21 = 10000000.5; [L43] float var_1_22 = 4.5; [L44] float var_1_23 = 4.25; [L45] signed short int var_1_24 = -16; [L46] unsigned short int var_1_25 = 100; [L47] unsigned long int var_1_27 = 8; [L48] signed long int var_1_34 = 8; [L49] unsigned char var_1_36 = 0; [L50] unsigned char var_1_37 = 0; [L51] unsigned char var_1_38 = 1; [L52] float var_1_39 = 10000000000000.5; [L53] float var_1_43 = 0.0; [L54] float var_1_44 = 0.4; [L55] signed long int var_1_45 = -128; [L56] signed short int var_1_46 = 2; VAL [isInitial=0, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_2=1607/8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L185] isInitial = 1 [L186] FCALL initially() [L187] COND TRUE 1 [L188] FCALL updateLastVariables() [L189] CALL updateVariables() [L127] var_1_2 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L128] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L129] var_1_3 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L130] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L131] var_1_4 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L132] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L133] var_1_5 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L134] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L135] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L135] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L136] var_1_6 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_7=25, var_1_8=0, var_1_9=-16] [L137] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_7=25, var_1_8=0, var_1_9=-16] [L138] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L138] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L139] var_1_8 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_9=-16] [L140] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_9=-16] [L141] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L141] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L142] var_1_11 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L143] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L144] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L144] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L145] var_1_13 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L146] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L147] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L147] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L148] var_1_14 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L150] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L150] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L151] var_1_16 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L152] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L153] CALL assume_abort_if_not(var_1_16 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L153] RET assume_abort_if_not(var_1_16 <= 16383) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L154] var_1_17 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L155] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L156] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L156] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L157] var_1_19 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L158] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L159] var_1_20 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L160] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L161] var_1_21 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L162] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L163] var_1_22 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L164] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L165] var_1_23 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L166] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L167] var_1_27 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L168] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L169] CALL assume_abort_if_not(var_1_27 <= 17) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L169] RET assume_abort_if_not(var_1_27 <= 17) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L170] var_1_37 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L171] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L172] CALL assume_abort_if_not(var_1_37 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L172] RET assume_abort_if_not(var_1_37 <= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L173] var_1_43 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_43 >= 4611686.018427382800e+12F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 9223372.036854765600e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L174] RET assume_abort_if_not((var_1_43 >= 4611686.018427382800e+12F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 9223372.036854765600e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L175] var_1_44 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_44 >= 0.0F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L176] RET assume_abort_if_not((var_1_44 >= 0.0F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L189] RET updateVariables() [L190] CALL step() [L60] EXPR var_1_5 >> var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L60] EXPR var_1_10 ^ var_1_14 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L60] COND FALSE !((var_1_5 >> var_1_27) > ((var_1_10 ^ var_1_14) + ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) [L63] COND TRUE ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) >= (var_1_4 - var_1_3) [L64] var_1_25 = var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L67] EXPR var_1_5 | var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L67] EXPR ((var_1_5 | var_1_27) < 0 ) ? -(var_1_5 | var_1_27) : (var_1_5 | var_1_27) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L67] EXPR var_1_5 | var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L67] EXPR ((var_1_5 | var_1_27) < 0 ) ? -(var_1_5 | var_1_27) : (var_1_5 | var_1_27) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L67] COND TRUE var_1_16 >= ((((var_1_5 | var_1_27) < 0 ) ? -(var_1_5 | var_1_27) : (var_1_5 | var_1_27))) [L68] var_1_34 = (((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) > (var_1_16)) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (var_1_16))) - ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L76] EXPR -10 & var_1_5 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L76] COND TRUE (-10 & var_1_5) <= var_1_6 [L77] COND TRUE var_1_4 != var_1_4 [L78] var_1_36 = var_1_37 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L81] var_1_38 = var_1_37 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L82] EXPR var_1_6 ^ var_1_17 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L82] COND FALSE !(var_1_27 == (var_1_6 ^ var_1_17)) [L85] var_1_39 = (((((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21)))) < (var_1_43)) ? (((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21)))) : (var_1_43))) - 255.4f) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=-16] [L87] var_1_45 = var_1_27 [L88] var_1_46 = var_1_27 [L89] var_1_9 = ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) [L90] signed long int stepLocal_1 = 56016 - var_1_11; [L91] signed long int stepLocal_0 = 10; VAL [isInitial=1, stepLocal_0=10, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=4, var_1_46=4, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=10] [L92] COND FALSE !(var_1_6 < stepLocal_0) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=4, var_1_46=4, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=10] [L97] COND FALSE !((var_1_13 - var_1_14) > (var_1_10 + var_1_11)) [L102] var_1_12 = var_1_14 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=4, var_1_46=4, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=10] [L104] var_1_15 = (var_1_14 - (((((var_1_16 + var_1_17)) > (4)) ? ((var_1_16 + var_1_17)) : (4)))) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-4, var_1_16=4, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=4, var_1_46=4, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=10] [L105] COND TRUE var_1_4 > var_1_2 [L106] var_1_18 = (((((var_1_19 + var_1_20) < 0 ) ? -(var_1_19 + var_1_20) : (var_1_19 + var_1_20))) - var_1_21) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-4, var_1_16=4, var_1_17=0, var_1_1=32, var_1_24=-16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=4, var_1_46=4, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=10] [L114] var_1_24 = 16 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-4, var_1_16=4, var_1_17=0, var_1_1=32, var_1_24=16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=4, var_1_46=4, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=10] [L115] COND TRUE var_1_18 <= (var_1_3 - var_1_4) [L116] var_1_1 = var_1_5 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-4, var_1_16=4, var_1_17=0, var_1_1=0, var_1_24=16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=4, var_1_46=4, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=10] [L120] COND FALSE !(\read(var_1_8)) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-4, var_1_16=4, var_1_17=0, var_1_1=0, var_1_24=16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=4, var_1_46=4, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=10] [L190] RET step() [L191] CALL, EXPR property() [L181-L182] return ((((((((var_1_18 <= (var_1_3 - var_1_4)) ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) && (var_1_8 ? ((var_1_5 < 16) ? (var_1_7 == ((unsigned long int) (var_1_6 + var_1_24))) : 1) : 1)) && (var_1_9 == ((signed long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) && ((var_1_6 < 10) ? ((var_1_5 < (56016 - var_1_11)) ? (var_1_10 == ((unsigned short int) var_1_5)) : 1) : 1)) && (((var_1_13 - var_1_14) > (var_1_10 + var_1_11)) ? ((! var_1_8) ? (var_1_12 == ((signed short int) var_1_13)) : 1) : (var_1_12 == ((signed short int) var_1_14)))) && (var_1_15 == ((signed short int) (var_1_14 - (((((var_1_16 + var_1_17)) > (4)) ? ((var_1_16 + var_1_17)) : (4))))))) && ((var_1_4 > var_1_2) ? (var_1_18 == ((float) (((((var_1_19 + var_1_20) < 0 ) ? -(var_1_19 + var_1_20) : (var_1_19 + var_1_20))) - var_1_21))) : ((! ((var_1_17 - var_1_11) < 128)) ? (var_1_18 == ((float) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (var_1_18 == ((float) ((((((((9.75f) > (var_1_19)) ? (9.75f) : (var_1_19)))) < ((((((var_1_21 - var_1_22)) > (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23))))) ? ((var_1_21 - var_1_22)) : (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23)))))))) ? (((((9.75f) > (var_1_19)) ? (9.75f) : (var_1_19)))) : ((((((var_1_21 - var_1_22)) > (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23))))) ? ((var_1_21 - var_1_22)) : (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23)))))))))))))) && (var_1_24 == ((signed short int) 16)) ; VAL [\result=0, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-4, var_1_16=4, var_1_17=0, var_1_1=0, var_1_24=16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=4, var_1_46=4, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=10] [L191] RET, EXPR property() [L191] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-4, var_1_16=4, var_1_17=0, var_1_1=0, var_1_24=16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=4, var_1_46=4, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=10] [L19] reach_error() VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-4, var_1_16=4, var_1_17=0, var_1_1=0, var_1_24=16, var_1_25=4, var_1_27=4, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=4, var_1_46=4, var_1_5=0, var_1_6=10, var_1_7=25, var_1_8=0, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 7, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 386 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 386 mSDsluCounter, 2490 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1486 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 311 IncrementalHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 1004 mSDtfsCounter, 311 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=427occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 219 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1414 NumberOfCodeBlocks, 1414 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1204 ConstructedInterpolants, 0 QuantifiedInterpolants, 1776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 10440/10440 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-08 22:18:47,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercode_fillercodestructure_filler-ps-ci_file-7.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 2443bff004680acf9358dc6eb7b3ebb2c0abce0266843d4c0b3809d4105241e0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:18:49,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:18:49,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:18:49,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:18:49,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:18:49,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:18:49,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:18:49,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:18:49,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:18:49,490 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:18:49,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:18:49,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:18:49,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:18:49,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:18:49,493 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:18:49,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:18:49,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:18:49,493 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:18:49,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:18:49,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:18:49,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:18:49,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:18:49,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:18:49,497 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:18:49,497 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:18:49,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:18:49,498 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:18:49,498 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:18:49,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:18:49,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:18:49,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:18:49,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:18:49,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:18:49,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:18:49,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:18:49,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:18:49,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:18:49,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:18:49,509 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:18:49,510 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:18:49,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:18:49,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:18:49,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:18:49,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:18:49,516 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 -> 2443bff004680acf9358dc6eb7b3ebb2c0abce0266843d4c0b3809d4105241e0 [2024-11-08 22:18:49,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:18:49,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:18:49,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:18:49,786 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:18:49,787 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:18:49,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i [2024-11-08 22:18:51,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:18:51,666 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:18:51,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i [2024-11-08 22:18:51,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1e7ca94/56e28d1a96aa4393b2dcea46687553da/FLAGa40bdd901 [2024-11-08 22:18:51,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1e7ca94/56e28d1a96aa4393b2dcea46687553da [2024-11-08 22:18:51,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:18:51,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:18:51,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:18:51,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:18:51,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:18:51,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:18:51" (1/1) ... [2024-11-08 22:18:51,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45dc235a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:51, skipping insertion in model container [2024-11-08 22:18:51,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:18:51" (1/1) ... [2024-11-08 22:18:51,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:18:51,858 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_fillercode_fillercodestructure_filler-ps-ci_file-7.i[918,931] [2024-11-08 22:18:51,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:18:51,981 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:18:51,991 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_fillercode_fillercodestructure_filler-ps-ci_file-7.i[918,931] [2024-11-08 22:18:52,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:18:52,051 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:18:52,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:52 WrapperNode [2024-11-08 22:18:52,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:18:52,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:18:52,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:18:52,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:18:52,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:52" (1/1) ... [2024-11-08 22:18:52,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:52" (1/1) ... [2024-11-08 22:18:52,097 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-11-08 22:18:52,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:18:52,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:18:52,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:18:52,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:18:52,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:52" (1/1) ... [2024-11-08 22:18:52,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:52" (1/1) ... [2024-11-08 22:18:52,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:52" (1/1) ... [2024-11-08 22:18:52,139 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:18:52,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:52" (1/1) ... [2024-11-08 22:18:52,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:52" (1/1) ... [2024-11-08 22:18:52,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:52" (1/1) ... [2024-11-08 22:18:52,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:52" (1/1) ... [2024-11-08 22:18:52,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:52" (1/1) ... [2024-11-08 22:18:52,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:52" (1/1) ... [2024-11-08 22:18:52,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:18:52,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:18:52,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:18:52,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:18:52,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:52" (1/1) ... [2024-11-08 22:18:52,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:18:52,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:18:52,202 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-08 22:18:52,206 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-08 22:18:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:18:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:18:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:18:52,235 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:18:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:18:52,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:18:52,308 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:18:52,310 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:18:53,756 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 22:18:53,756 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:18:53,780 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:18:53,781 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:18:53,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:18:53 BoogieIcfgContainer [2024-11-08 22:18:53,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:18:53,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:18:53,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:18:53,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:18:53,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:18:51" (1/3) ... [2024-11-08 22:18:53,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a06e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:18:53, skipping insertion in model container [2024-11-08 22:18:53,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:52" (2/3) ... [2024-11-08 22:18:53,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a06e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:18:53, skipping insertion in model container [2024-11-08 22:18:53,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:18:53" (3/3) ... [2024-11-08 22:18:53,803 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i [2024-11-08 22:18:53,833 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:18:53,834 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:18:53,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:18:53,959 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;@63d1b824, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:18:53,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:18:53,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 22:18:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 22:18:53,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:53,990 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:18:53,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:54,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:54,005 INFO L85 PathProgramCache]: Analyzing trace with hash 870121292, now seen corresponding path program 1 times [2024-11-08 22:18:54,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:18:54,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020402224] [2024-11-08 22:18:54,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:54,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:18:54,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:18:54,035 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-08 22:18:54,036 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-08 22:18:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:54,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:18:54,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:18:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 1282 trivial. 0 not checked. [2024-11-08 22:18:54,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:18:54,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:18:54,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020402224] [2024-11-08 22:18:54,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020402224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:54,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:54,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:18:54,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676517184] [2024-11-08 22:18:54,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:54,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:18:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:18:54,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:18:54,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:18:54,747 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 22:18:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:54,820 INFO L93 Difference]: Finished difference Result 173 states and 302 transitions. [2024-11-08 22:18:54,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:18:54,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 192 [2024-11-08 22:18:54,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:54,865 INFO L225 Difference]: With dead ends: 173 [2024-11-08 22:18:54,869 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 22:18:54,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 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-08 22:18:54,889 INFO L432 NwaCegarLoop]: 131 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, 131 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-08 22:18:54,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:18:54,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 22:18:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-08 22:18:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 22:18:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 131 transitions. [2024-11-08 22:18:54,970 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 131 transitions. Word has length 192 [2024-11-08 22:18:54,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:54,971 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 131 transitions. [2024-11-08 22:18:54,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 22:18:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 131 transitions. [2024-11-08 22:18:54,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 22:18:54,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:54,982 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:18:54,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 22:18:55,185 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-08 22:18:55,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:55,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:55,189 INFO L85 PathProgramCache]: Analyzing trace with hash 284855264, now seen corresponding path program 1 times [2024-11-08 22:18:55,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:18:55,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533902527] [2024-11-08 22:18:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:55,192 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-08 22:18:55,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:18:55,195 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-08 22:18:55,200 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-08 22:18:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:55,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 22:18:55,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:19:12,565 WARN L286 SmtUtils]: Spent 6.39s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:19:31,121 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)