./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.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 9a0c37ebc273c362e4d2cb519b4c223d2a9b2256e1ef158a08ce7f4ca051bc4d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:25:50,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:25:50,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:25:50,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:25:50,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:25:50,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:25:50,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:25:50,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:25:50,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:25:50,380 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:25:50,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:25:50,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:25:50,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:25:50,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:25:50,384 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:25:50,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:25:50,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:25:50,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:25:50,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:25:50,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:25:50,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:25:50,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:25:50,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:25:50,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:25:50,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:25:50,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:25:50,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:25:50,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:25:50,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:25:50,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:25:50,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:25:50,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:25:50,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:25:50,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:25:50,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:25:50,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:25:50,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:25:50,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:25:50,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:25:50,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:25:50,396 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:25:50,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:25:50,396 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 -> 9a0c37ebc273c362e4d2cb519b4c223d2a9b2256e1ef158a08ce7f4ca051bc4d [2024-10-24 07:25:50,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:25:50,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:25:50,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:25:50,683 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:25:50,684 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:25:50,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-10-24 07:25:52,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:25:52,397 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:25:52,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-10-24 07:25:52,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee8fbcb1/7494688d55f844b886ad21f36b515bb9/FLAG4a46a7fec [2024-10-24 07:25:52,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee8fbcb1/7494688d55f844b886ad21f36b515bb9 [2024-10-24 07:25:52,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:25:52,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:25:52,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:25:52,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:25:52,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:25:52,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:25:52" (1/1) ... [2024-10-24 07:25:52,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8aa93ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:52, skipping insertion in model container [2024-10-24 07:25:52,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:25:52" (1/1) ... [2024-10-24 07:25:52,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:25:53,007 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i[919,932] [2024-10-24 07:25:53,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:25:53,098 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:25:53,110 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i[919,932] [2024-10-24 07:25:53,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:25:53,169 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:25:53,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:53 WrapperNode [2024-10-24 07:25:53,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:25:53,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:25:53,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:25:53,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:25:53,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:53" (1/1) ... [2024-10-24 07:25:53,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:53" (1/1) ... [2024-10-24 07:25:53,235 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-10-24 07:25:53,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:25:53,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:25:53,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:25:53,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:25:53,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:53" (1/1) ... [2024-10-24 07:25:53,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:53" (1/1) ... [2024-10-24 07:25:53,256 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:53" (1/1) ... [2024-10-24 07:25:53,288 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-10-24 07:25:53,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:53" (1/1) ... [2024-10-24 07:25:53,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:53" (1/1) ... [2024-10-24 07:25:53,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:53" (1/1) ... [2024-10-24 07:25:53,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:53" (1/1) ... [2024-10-24 07:25:53,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:53" (1/1) ... [2024-10-24 07:25:53,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:53" (1/1) ... [2024-10-24 07:25:53,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:25:53,339 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:25:53,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:25:53,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:25:53,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:53" (1/1) ... [2024-10-24 07:25:53,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:25:53,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:25:53,387 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-10-24 07:25:53,390 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-10-24 07:25:53,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:25:53,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:25:53,441 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:25:53,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:25:53,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:25:53,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:25:53,538 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:25:53,540 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:25:54,034 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 07:25:54,035 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:25:54,086 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:25:54,086 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:25:54,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:25:54 BoogieIcfgContainer [2024-10-24 07:25:54,087 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:25:54,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:25:54,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:25:54,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:25:54,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:25:52" (1/3) ... [2024-10-24 07:25:54,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600f6578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:25:54, skipping insertion in model container [2024-10-24 07:25:54,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:53" (2/3) ... [2024-10-24 07:25:54,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600f6578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:25:54, skipping insertion in model container [2024-10-24 07:25:54,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:25:54" (3/3) ... [2024-10-24 07:25:54,099 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-10-24 07:25:54,117 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:25:54,117 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:25:54,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:25:54,209 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;@6c176e20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:25:54,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:25:54,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 07:25:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-24 07:25:54,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:25:54,245 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:25:54,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:25:54,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:25:54,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1742159795, now seen corresponding path program 1 times [2024-10-24 07:25:54,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:25:54,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130902182] [2024-10-24 07:25:54,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:54,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:25:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:25:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:25:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 07:25:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:25:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:25:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:25:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:25:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:25:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:25:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:25:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:25:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:25:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:25:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:25:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:25:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:25:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:25:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:25:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:25:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:25:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:25:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:25:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:25:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:25:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:25:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:25:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:25:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 07:25:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 07:25:54,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:25:54,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130902182] [2024-10-24 07:25:54,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130902182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:25:54,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:25:54,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:25:54,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441710146] [2024-10-24 07:25:54,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:25:54,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:25:54,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:25:54,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:25:54,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:25:54,982 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:25:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:25:55,042 INFO L93 Difference]: Finished difference Result 161 states and 296 transitions. [2024-10-24 07:25:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:25:55,045 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-10-24 07:25:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:25:55,056 INFO L225 Difference]: With dead ends: 161 [2024-10-24 07:25:55,056 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 07:25:55,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:25:55,065 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:25:55,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:25:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 07:25:55,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-24 07:25:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 07:25:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 128 transitions. [2024-10-24 07:25:55,120 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 128 transitions. Word has length 176 [2024-10-24 07:25:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:25:55,122 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 128 transitions. [2024-10-24 07:25:55,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:25:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 128 transitions. [2024-10-24 07:25:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-24 07:25:55,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:25:55,129 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:25:55,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:25:55,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:25:55,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:25:55,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2135186805, now seen corresponding path program 1 times [2024-10-24 07:25:55,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:25:55,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167166010] [2024-10-24 07:25:55,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:55,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:25:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:25:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:25:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 07:25:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:25:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:25:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:25:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:25:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:25:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:25:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:25:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:25:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:25:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:25:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:25:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:25:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:25:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:25:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:25:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:25:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:25:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:25:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:25:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:25:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:25:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:25:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:55,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:25:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:25:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 07:25:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 07:25:56,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:25:56,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167166010] [2024-10-24 07:25:56,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167166010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:25:56,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:25:56,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:25:56,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672840942] [2024-10-24 07:25:56,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:25:56,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:25:56,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:25:56,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:25:56,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:25:56,034 INFO L87 Difference]: Start difference. First operand 80 states and 128 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 07:25:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:25:56,214 INFO L93 Difference]: Finished difference Result 238 states and 382 transitions. [2024-10-24 07:25:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:25:56,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 176 [2024-10-24 07:25:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:25:56,218 INFO L225 Difference]: With dead ends: 238 [2024-10-24 07:25:56,222 INFO L226 Difference]: Without dead ends: 159 [2024-10-24 07:25:56,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:25:56,224 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 137 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:25:56,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 233 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:25:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-24 07:25:56,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2024-10-24 07:25:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 97 states have internal predecessors, (139), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 07:25:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 251 transitions. [2024-10-24 07:25:56,279 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 251 transitions. Word has length 176 [2024-10-24 07:25:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:25:56,281 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 251 transitions. [2024-10-24 07:25:56,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 07:25:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 251 transitions. [2024-10-24 07:25:56,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 07:25:56,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:25:56,287 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:25:56,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:25:56,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:25:56,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:25:56,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1020699164, now seen corresponding path program 1 times [2024-10-24 07:25:56,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:25:56,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866314374] [2024-10-24 07:25:56,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:56,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:25:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:25:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:25:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 07:25:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:25:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:25:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:25:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:25:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:25:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:25:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:25:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:25:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:25:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:25:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:25:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:25:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:25:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:25:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:25:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:25:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:25:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:25:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:25:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:25:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:25:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:25:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:25:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:25:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 07:25:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 07:25:56,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:25:56,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866314374] [2024-10-24 07:25:56,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866314374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:25:56,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:25:56,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:25:56,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890468532] [2024-10-24 07:25:56,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:25:56,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:25:56,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:25:56,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:25:56,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:25:56,789 INFO L87 Difference]: Start difference. First operand 156 states and 251 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:25:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:25:56,908 INFO L93 Difference]: Finished difference Result 377 states and 603 transitions. [2024-10-24 07:25:56,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:25:56,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-10-24 07:25:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:25:56,913 INFO L225 Difference]: With dead ends: 377 [2024-10-24 07:25:56,913 INFO L226 Difference]: Without dead ends: 222 [2024-10-24 07:25:56,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:25:56,919 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 47 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:25:56,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 275 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:25:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-24 07:25:56,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 213. [2024-10-24 07:25:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 146 states have (on average 1.4383561643835616) internal successors, (210), 148 states have internal predecessors, (210), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 07:25:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 334 transitions. [2024-10-24 07:25:56,968 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 334 transitions. Word has length 177 [2024-10-24 07:25:56,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:25:56,969 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 334 transitions. [2024-10-24 07:25:56,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:25:56,969 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 334 transitions. [2024-10-24 07:25:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-24 07:25:56,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:25:56,977 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:25:56,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:25:56,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:25:56,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:25:56,979 INFO L85 PathProgramCache]: Analyzing trace with hash 334817835, now seen corresponding path program 1 times [2024-10-24 07:25:56,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:25:56,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111671877] [2024-10-24 07:25:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:25:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:25:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:25:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 07:25:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:25:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:25:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:25:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:25:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:25:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:25:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:25:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:25:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:25:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:25:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:25:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:25:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:25:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:25:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:25:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:25:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:25:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:25:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:25:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:25:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:25:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:25:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:25:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:25:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 07:25:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 07:25:57,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:25:57,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111671877] [2024-10-24 07:25:57,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111671877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:25:57,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:25:57,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:25:57,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621001160] [2024-10-24 07:25:57,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:25:57,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:25:57,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:25:57,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:25:57,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:25:57,397 INFO L87 Difference]: Start difference. First operand 213 states and 334 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:25:57,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:25:57,706 INFO L93 Difference]: Finished difference Result 376 states and 587 transitions. [2024-10-24 07:25:57,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:25:57,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-10-24 07:25:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:25:57,714 INFO L225 Difference]: With dead ends: 376 [2024-10-24 07:25:57,714 INFO L226 Difference]: Without dead ends: 264 [2024-10-24 07:25:57,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:25:57,719 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 154 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:25:57,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 441 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:25:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-24 07:25:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 220. [2024-10-24 07:25:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 155 states have internal predecessors, (219), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 07:25:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 343 transitions. [2024-10-24 07:25:57,767 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 343 transitions. Word has length 178 [2024-10-24 07:25:57,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:25:57,769 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 343 transitions. [2024-10-24 07:25:57,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:25:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 343 transitions. [2024-10-24 07:25:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-24 07:25:57,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:25:57,772 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:25:57,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 07:25:57,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:25:57,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:25:57,777 INFO L85 PathProgramCache]: Analyzing trace with hash -945045843, now seen corresponding path program 1 times [2024-10-24 07:25:57,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:25:57,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949559446] [2024-10-24 07:25:57,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:57,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:25:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:25:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:25:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 07:25:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:25:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:25:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:25:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:25:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:25:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:25:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:25:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:25:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:25:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:25:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:25:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:25:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:25:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:25:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 07:25:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:25:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 07:25:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:25:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 07:25:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:25:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 07:25:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:25:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:25:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:25:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 07:25:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-24 07:25:58,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:25:58,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949559446] [2024-10-24 07:25:58,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949559446] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:25:58,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211637674] [2024-10-24 07:25:58,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:58,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:25:58,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:25:58,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:25:58,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 07:25:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 07:25:58,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:25:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 363 proven. 9 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2024-10-24 07:25:58,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:25:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-24 07:25:58,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211637674] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:25:58,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:25:58,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 07:25:58,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55236276] [2024-10-24 07:25:58,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:25:58,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 07:25:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:25:58,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 07:25:58,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:25:58,607 INFO L87 Difference]: Start difference. First operand 220 states and 343 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 07:25:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:25:59,028 INFO L93 Difference]: Finished difference Result 491 states and 759 transitions. [2024-10-24 07:25:59,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 07:25:59,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 178 [2024-10-24 07:25:59,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:25:59,032 INFO L225 Difference]: With dead ends: 491 [2024-10-24 07:25:59,032 INFO L226 Difference]: Without dead ends: 272 [2024-10-24 07:25:59,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:25:59,034 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 83 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:25:59,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 317 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:25:59,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-24 07:25:59,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 265. [2024-10-24 07:25:59,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 172 states have (on average 1.3662790697674418) internal successors, (235), 175 states have internal predecessors, (235), 86 states have call successors, (86), 6 states have call predecessors, (86), 6 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-24 07:25:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 407 transitions. [2024-10-24 07:25:59,073 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 407 transitions. Word has length 178 [2024-10-24 07:25:59,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:25:59,074 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 407 transitions. [2024-10-24 07:25:59,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 07:25:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 407 transitions. [2024-10-24 07:25:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 07:25:59,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:25:59,076 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:25:59,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 07:25:59,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:25:59,281 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:25:59,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:25:59,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1936698910, now seen corresponding path program 1 times [2024-10-24 07:25:59,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:25:59,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714413389] [2024-10-24 07:25:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:59,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:25:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:25:59,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866643988] [2024-10-24 07:25:59,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:59,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:25:59,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:25:59,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:25:59,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 07:25:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:25:59,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 07:25:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:25:59,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 07:25:59,757 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 07:25:59,758 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 07:25:59,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 07:25:59,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 07:25:59,963 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 07:26:00,092 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 07:26:00,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:26:00 BoogieIcfgContainer [2024-10-24 07:26:00,095 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 07:26:00,095 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 07:26:00,095 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 07:26:00,096 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 07:26:00,096 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:25:54" (3/4) ... [2024-10-24 07:26:00,098 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 07:26:00,099 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 07:26:00,100 INFO L158 Benchmark]: Toolchain (without parser) took 7337.63ms. Allocated memory was 115.3MB in the beginning and 188.7MB in the end (delta: 73.4MB). Free memory was 46.1MB in the beginning and 120.0MB in the end (delta: -73.9MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. [2024-10-24 07:26:00,100 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 115.3MB. Free memory was 73.2MB in the beginning and 73.0MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:26:00,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.31ms. Allocated memory was 115.3MB in the beginning and 157.3MB in the end (delta: 41.9MB). Free memory was 45.9MB in the beginning and 115.5MB in the end (delta: -69.7MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-10-24 07:26:00,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.04ms. Allocated memory is still 157.3MB. Free memory was 115.5MB in the beginning and 110.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 07:26:00,101 INFO L158 Benchmark]: Boogie Preprocessor took 102.02ms. Allocated memory is still 157.3MB. Free memory was 110.5MB in the beginning and 104.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 07:26:00,101 INFO L158 Benchmark]: RCFGBuilder took 747.95ms. Allocated memory is still 157.3MB. Free memory was 104.2MB in the beginning and 73.8MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-24 07:26:00,102 INFO L158 Benchmark]: TraceAbstraction took 6005.52ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 72.7MB in the beginning and 120.0MB in the end (delta: -47.3MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2024-10-24 07:26:00,102 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 188.7MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:26:00,104 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.22ms. Allocated memory is still 115.3MB. Free memory was 73.2MB in the beginning and 73.0MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.31ms. Allocated memory was 115.3MB in the beginning and 157.3MB in the end (delta: 41.9MB). Free memory was 45.9MB in the beginning and 115.5MB in the end (delta: -69.7MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.04ms. Allocated memory is still 157.3MB. Free memory was 115.5MB in the beginning and 110.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.02ms. Allocated memory is still 157.3MB. Free memory was 110.5MB in the beginning and 104.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 747.95ms. Allocated memory is still 157.3MB. Free memory was 104.2MB in the beginning and 73.8MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6005.52ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 72.7MB in the beginning and 120.0MB in the end (delta: -47.3MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 188.7MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 205. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 16; [L23] signed long int var_1_4 = -64; [L24] signed char var_1_9 = 10; [L25] unsigned char var_1_10 = 0; [L26] signed char var_1_11 = -1; [L27] unsigned short int var_1_12 = 10000; [L28] float var_1_13 = 5.4; [L29] float var_1_14 = 1.4; [L30] unsigned short int var_1_18 = 32; [L31] double var_1_20 = 1.5; [L32] double var_1_21 = 2.75; [L33] unsigned char var_1_22 = 5; [L34] unsigned short int var_1_23 = 55712; [L35] unsigned char var_1_24 = 5; [L36] signed short int var_1_25 = 10; [L37] float var_1_26 = 64.2; [L38] unsigned short int var_1_27 = 64; [L39] float var_1_33 = 2.5; [L40] unsigned long int var_1_35 = 10; [L41] unsigned long int var_1_37 = 2924974040; [L42] unsigned char var_1_38 = 1; [L43] unsigned char var_1_39 = 0; [L44] unsigned char var_1_40 = 0; [L45] unsigned char var_1_41 = 0; [L46] unsigned char var_1_44 = 0; [L47] unsigned char var_1_45 = 0; [L48] unsigned long int var_1_46 = 32; [L49] unsigned long int var_1_47 = 1000000000; [L50] unsigned long int last_1_var_1_1 = 16; [L51] signed char last_1_var_1_9 = 10; [L52] unsigned short int last_1_var_1_12 = 10000; [L53] double last_1_var_1_20 = 1.5; [L54] unsigned char last_1_var_1_22 = 5; [L55] signed short int last_1_var_1_25 = 10; [L209] isInitial = 1 [L210] FCALL initially() [L211] COND TRUE 1 [L212] CALL updateLastVariables() [L197] last_1_var_1_1 = var_1_1 [L198] last_1_var_1_9 = var_1_9 [L199] last_1_var_1_12 = var_1_12 [L200] last_1_var_1_20 = var_1_20 [L201] last_1_var_1_22 = var_1_22 [L202] last_1_var_1_25 = var_1_25 [L212] RET updateLastVariables() [L213] CALL updateVariables() [L152] var_1_4 = __VERIFIER_nondet_long() [L153] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L153] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L154] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L154] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L155] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L155] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L156] var_1_10 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L157] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L158] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L159] var_1_11 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L160] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L161] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L161] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L162] var_1_13 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L163] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L164] var_1_14 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L165] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L166] var_1_18 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L167] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L168] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L168] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L169] var_1_21 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L170] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L171] var_1_23 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L172] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L173] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L173] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L174] var_1_24 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L175] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L176] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L176] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L177] var_1_26 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L178] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L179] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L179] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L180] var_1_37 = __VERIFIER_nondet_ulong() [L181] CALL assume_abort_if_not(var_1_37 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L181] RET assume_abort_if_not(var_1_37 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L182] CALL assume_abort_if_not(var_1_37 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L182] RET assume_abort_if_not(var_1_37 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L183] var_1_39 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L184] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L185] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L185] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L186] var_1_40 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_40 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L187] RET assume_abort_if_not(var_1_40 >= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L188] CALL assume_abort_if_not(var_1_40 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L188] RET assume_abort_if_not(var_1_40 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L189] var_1_44 = __VERIFIER_nondet_uchar() [L190] CALL assume_abort_if_not(var_1_44 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L190] RET assume_abort_if_not(var_1_44 >= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L191] CALL assume_abort_if_not(var_1_44 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L191] RET assume_abort_if_not(var_1_44 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L192] var_1_45 = __VERIFIER_nondet_uchar() [L193] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L193] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L194] CALL assume_abort_if_not(var_1_45 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L194] RET assume_abort_if_not(var_1_45 <= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L213] RET updateVariables() [L214] CALL step() [L59] COND FALSE !(! var_1_10) [L66] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L68] COND TRUE var_1_11 < (var_1_12 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L69] COND TRUE \read(var_1_10) [L70] var_1_27 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L73] COND TRUE var_1_13 >= (- 255.45f) [L74] var_1_38 = ((! var_1_39) && var_1_40) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L80] unsigned char stepLocal_2 = var_1_10; [L81] signed long int stepLocal_1 = last_1_var_1_22; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, stepLocal_2=1, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L82] COND TRUE ((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || stepLocal_2 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L83] COND FALSE !(stepLocal_1 >= last_1_var_1_12) [L86] var_1_12 = last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L89] COND TRUE \read(var_1_44) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L90] COND FALSE !(\read(var_1_45)) [L95] var_1_47 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L98] unsigned long int stepLocal_5 = last_1_var_1_1; [L99] signed long int stepLocal_4 = var_1_4 + last_1_var_1_9; [L100] unsigned short int stepLocal_3 = var_1_18; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, stepLocal_5=16, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L101] COND FALSE !(stepLocal_5 > last_1_var_1_12) [L112] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L114] COND TRUE var_1_11 > (var_1_22 * (var_1_12 + var_1_22)) [L115] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L117] COND FALSE !(var_1_12 < var_1_12) [L120] var_1_33 = var_1_21 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L122] COND FALSE !((var_1_20 / var_1_26) > var_1_13) [L125] var_1_25 = var_1_11 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L127] COND TRUE \read(var_1_10) [L128] var_1_35 = ((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=32767, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L136] signed long int stepLocal_0 = (var_1_25 + var_1_9) / var_1_4; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_0=1, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=32767, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L137] COND TRUE stepLocal_0 == var_1_25 [L138] var_1_1 = (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=32767, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L140] COND TRUE ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < (var_1_9 % var_1_4) [L141] var_1_41 = ((! (var_1_40 && var_1_44)) || (var_1_39 && var_1_45)) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=32767, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L145] COND TRUE \read(var_1_10) [L146] var_1_46 = (var_1_24 + ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=32767, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=0, var_1_47=0, var_1_4=2, var_1_9=1] [L214] RET step() [L215] CALL, EXPR property() [L205-L206] return ((((((((var_1_25 + var_1_9) / var_1_4) == var_1_25) ? (var_1_1 == ((unsigned long int) (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22))) : 1) && ((! var_1_10) ? ((((((last_1_var_1_22) > (last_1_var_1_25)) ? (last_1_var_1_22) : (last_1_var_1_25))) >= last_1_var_1_12) ? (var_1_9 == ((signed char) (-16 + var_1_11))) : (var_1_9 == ((signed char) var_1_11))) : (var_1_9 == ((signed char) var_1_11)))) && ((((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || var_1_10) ? ((last_1_var_1_22 >= last_1_var_1_12) ? (var_1_12 == ((unsigned short int) (((((last_1_var_1_22) < (last_1_var_1_22)) ? (last_1_var_1_22) : (last_1_var_1_22))) + 32))) : (var_1_12 == ((unsigned short int) last_1_var_1_22))) : 1)) && ((var_1_11 > (var_1_22 * (var_1_12 + var_1_22))) ? (var_1_20 == ((double) var_1_21)) : 1)) && ((last_1_var_1_1 > last_1_var_1_12) ? ((last_1_var_1_1 >= (var_1_4 + last_1_var_1_9)) ? ((var_1_18 == (var_1_23 - 8)) ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24)))) && (((var_1_20 / var_1_26) > var_1_13) ? (var_1_25 == ((signed short int) ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))))) : (var_1_25 == ((signed short int) var_1_11))) ; [L215] RET, EXPR property() [L215] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=32767, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=0, var_1_47=0, var_1_4=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=32767, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=0, var_1_47=0, var_1_4=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 6, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 445 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 421 mSDsluCounter, 1391 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 749 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 484 IncrementalHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 642 mSDtfsCounter, 484 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 662 GetRequests, 643 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred 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, 5 MinimizatonAttempts, 63 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1421 NumberOfCodeBlocks, 1421 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1234 ConstructedInterpolants, 0 QuantifiedInterpolants, 2555 SizeOfPredicates, 0 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 10557/10584 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 07:26:00,137 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.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 9a0c37ebc273c362e4d2cb519b4c223d2a9b2256e1ef158a08ce7f4ca051bc4d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:26:02,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:26:02,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 07:26:02,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:26:02,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:26:02,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:26:02,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:26:02,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:26:02,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:26:02,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:26:02,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:26:02,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:26:02,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:26:02,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:26:02,581 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:26:02,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:26:02,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:26:02,585 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:26:02,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:26:02,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:26:02,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:26:02,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:26:02,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:26:02,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 07:26:02,587 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 07:26:02,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:26:02,587 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 07:26:02,588 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:26:02,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:26:02,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:26:02,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:26:02,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:26:02,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:26:02,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:26:02,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:26:02,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:26:02,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:26:02,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:26:02,595 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 07:26:02,595 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 07:26:02,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:26:02,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:26:02,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:26:02,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:26:02,597 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 07:26:02,597 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 -> 9a0c37ebc273c362e4d2cb519b4c223d2a9b2256e1ef158a08ce7f4ca051bc4d [2024-10-24 07:26:02,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:26:02,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:26:02,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:26:02,999 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:26:03,000 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:26:03,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-10-24 07:26:04,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:26:04,874 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:26:04,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-10-24 07:26:04,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4101c8f22/d37a8ca3e9824864953e31f35d843680/FLAGe99ca1ec3 [2024-10-24 07:26:04,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4101c8f22/d37a8ca3e9824864953e31f35d843680 [2024-10-24 07:26:04,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:26:04,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:26:04,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:26:04,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:26:04,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:26:04,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:26:04" (1/1) ... [2024-10-24 07:26:04,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dab6a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:04, skipping insertion in model container [2024-10-24 07:26:04,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:26:04" (1/1) ... [2024-10-24 07:26:04,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:26:05,130 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i[919,932] [2024-10-24 07:26:05,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:26:05,241 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:26:05,257 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i[919,932] [2024-10-24 07:26:05,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:26:05,351 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:26:05,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:05 WrapperNode [2024-10-24 07:26:05,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:26:05,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:26:05,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:26:05,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:26:05,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:05" (1/1) ... [2024-10-24 07:26:05,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:05" (1/1) ... [2024-10-24 07:26:05,443 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-10-24 07:26:05,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:26:05,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:26:05,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:26:05,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:26:05,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:05" (1/1) ... [2024-10-24 07:26:05,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:05" (1/1) ... [2024-10-24 07:26:05,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:05" (1/1) ... [2024-10-24 07:26:05,498 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-10-24 07:26:05,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:05" (1/1) ... [2024-10-24 07:26:05,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:05" (1/1) ... [2024-10-24 07:26:05,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:05" (1/1) ... [2024-10-24 07:26:05,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:05" (1/1) ... [2024-10-24 07:26:05,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:05" (1/1) ... [2024-10-24 07:26:05,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:05" (1/1) ... [2024-10-24 07:26:05,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:26:05,545 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:26:05,545 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:26:05,545 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:26:05,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:05" (1/1) ... [2024-10-24 07:26:05,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:26:05,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:26:05,586 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-10-24 07:26:05,590 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-10-24 07:26:05,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:26:05,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 07:26:05,637 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:26:05,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:26:05,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:26:05,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:26:05,745 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:26:05,748 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:26:19,511 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 07:26:19,512 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:26:19,566 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:26:19,566 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:26:19,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:26:19 BoogieIcfgContainer [2024-10-24 07:26:19,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:26:19,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:26:19,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:26:19,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:26:19,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:26:04" (1/3) ... [2024-10-24 07:26:19,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6046c980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:26:19, skipping insertion in model container [2024-10-24 07:26:19,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:05" (2/3) ... [2024-10-24 07:26:19,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6046c980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:26:19, skipping insertion in model container [2024-10-24 07:26:19,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:26:19" (3/3) ... [2024-10-24 07:26:19,581 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-10-24 07:26:19,599 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:26:19,600 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:26:19,690 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:26:19,698 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;@6331bad5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:26:19,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:26:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 07:26:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-24 07:26:19,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:19,722 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:26:19,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:19,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:19,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1742159795, now seen corresponding path program 1 times [2024-10-24 07:26:19,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:26:19,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141729168] [2024-10-24 07:26:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:19,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:26:19,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:26:19,750 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-10-24 07:26:19,751 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-10-24 07:26:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:20,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 07:26:20,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 07:26:20,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:26:20,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:26:20,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141729168] [2024-10-24 07:26:20,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141729168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:20,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:26:20,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:26:20,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592020978] [2024-10-24 07:26:20,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:20,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:26:20,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:26:20,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:26:20,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:26:20,846 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:26:25,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:26:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:25,317 INFO L93 Difference]: Finished difference Result 161 states and 296 transitions. [2024-10-24 07:26:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:26:25,415 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-10-24 07:26:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:25,424 INFO L225 Difference]: With dead ends: 161 [2024-10-24 07:26:25,424 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 07:26:25,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:26:25,430 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:25,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-24 07:26:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 07:26:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-24 07:26:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 07:26:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 128 transitions. [2024-10-24 07:26:25,492 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 128 transitions. Word has length 176 [2024-10-24 07:26:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:25,495 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 128 transitions. [2024-10-24 07:26:25,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:26:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 128 transitions. [2024-10-24 07:26:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-24 07:26:25,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:25,500 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:26:25,526 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-10-24 07:26:25,701 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-10-24 07:26:25,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:25,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2135186805, now seen corresponding path program 1 times [2024-10-24 07:26:25,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:26:25,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211784080] [2024-10-24 07:26:25,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:25,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:26:25,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:26:25,705 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-10-24 07:26:25,707 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-10-24 07:26:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 07:26:26,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 403 proven. 69 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2024-10-24 07:26:30,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:26:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 07:26:32,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:26:32,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211784080] [2024-10-24 07:26:32,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211784080] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 07:26:32,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 07:26:32,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2024-10-24 07:26:32,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466046263] [2024-10-24 07:26:32,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:32,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:26:32,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:26:32,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:26:32,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 07:26:32,749 INFO L87 Difference]: Start difference. First operand 80 states and 128 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:26:37,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:26:41,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:26:45,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:26:49,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:26:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:50,155 INFO L93 Difference]: Finished difference Result 194 states and 310 transitions. [2024-10-24 07:26:50,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:26:50,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-10-24 07:26:50,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:50,159 INFO L225 Difference]: With dead ends: 194 [2024-10-24 07:26:50,160 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 07:26:50,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 07:26:50,162 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 83 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 22 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:50,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 240 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 22 Invalid, 4 Unknown, 0 Unchecked, 17.4s Time] [2024-10-24 07:26:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 07:26:50,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2024-10-24 07:26:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 79 states have internal predecessors, (114), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 07:26:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 176 transitions. [2024-10-24 07:26:50,190 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 176 transitions. Word has length 176 [2024-10-24 07:26:50,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:50,191 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 176 transitions. [2024-10-24 07:26:50,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:26:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 176 transitions. [2024-10-24 07:26:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 07:26:50,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:50,201 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:26:50,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 07:26:50,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:26:50,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:50,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:50,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1286600604, now seen corresponding path program 1 times [2024-10-24 07:26:50,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:26:50,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784359023] [2024-10-24 07:26:50,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:50,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:26:50,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:26:50,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:26:50,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 07:26:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 07:26:51,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 07:26:56,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:26:56,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:26:56,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784359023] [2024-10-24 07:26:56,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784359023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:56,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:26:56,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:26:56,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261487281] [2024-10-24 07:26:56,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:56,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:26:56,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:26:56,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:26:56,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:26:56,089 INFO L87 Difference]: Start difference. First operand 112 states and 176 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:27:03,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:27:07,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:27:11,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 07:27:15,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 07:27:19,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]