./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-pe-co_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-pe-co_file-37.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 586631ca404c1b537cc1b6f6da4a014826fc10fbc299a5b43a0d3245229f10ab --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:25:40,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:25:40,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:25:40,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:25:40,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:25:40,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:25:40,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:25:40,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:25:40,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:25:40,162 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:25:40,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:25:40,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:25:40,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:25:40,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:25:40,164 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:25:40,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:25:40,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:25:40,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:25:40,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:25:40,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:25:40,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:25:40,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:25:40,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:25:40,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:25:40,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:25:40,168 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:25:40,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:25:40,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:25:40,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:25:40,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:25:40,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:25:40,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:25:40,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:25:40,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:25:40,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:25:40,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:25:40,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:25:40,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:25:40,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:25:40,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:25:40,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:25:40,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:25:40,172 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 -> 586631ca404c1b537cc1b6f6da4a014826fc10fbc299a5b43a0d3245229f10ab [2024-10-14 09:25:40,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:25:40,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:25:40,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:25:40,428 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:25:40,429 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:25:40,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i [2024-10-14 09:25:41,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:25:41,961 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:25:41,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i [2024-10-14 09:25:41,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/217a660b0/f6b8138ed2dd45969830f7cea09d2ebd/FLAGa65f38cf1 [2024-10-14 09:25:41,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/217a660b0/f6b8138ed2dd45969830f7cea09d2ebd [2024-10-14 09:25:41,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:25:41,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:25:41,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:25:41,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:25:42,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:25:42,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:25:41" (1/1) ... [2024-10-14 09:25:42,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cdbae30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42, skipping insertion in model container [2024-10-14 09:25:42,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:25:41" (1/1) ... [2024-10-14 09:25:42,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:25:42,179 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-pe-co_file-37.i[919,932] [2024-10-14 09:25:42,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:25:42,282 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:25:42,314 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-pe-co_file-37.i[919,932] [2024-10-14 09:25:42,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:25:42,380 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:25:42,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42 WrapperNode [2024-10-14 09:25:42,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:25:42,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:25:42,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:25:42,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:25:42,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42" (1/1) ... [2024-10-14 09:25:42,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42" (1/1) ... [2024-10-14 09:25:42,441 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2024-10-14 09:25:42,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:25:42,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:25:42,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:25:42,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:25:42,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42" (1/1) ... [2024-10-14 09:25:42,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42" (1/1) ... [2024-10-14 09:25:42,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42" (1/1) ... [2024-10-14 09:25:42,491 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-14 09:25:42,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42" (1/1) ... [2024-10-14 09:25:42,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42" (1/1) ... [2024-10-14 09:25:42,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42" (1/1) ... [2024-10-14 09:25:42,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42" (1/1) ... [2024-10-14 09:25:42,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42" (1/1) ... [2024-10-14 09:25:42,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42" (1/1) ... [2024-10-14 09:25:42,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:25:42,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:25:42,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:25:42,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:25:42,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42" (1/1) ... [2024-10-14 09:25:42,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:25:42,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:25:42,564 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-14 09:25:42,566 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-14 09:25:42,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:25:42,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:25:42,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:25:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:25:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:25:42,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:25:42,673 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:25:42,674 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:25:43,066 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 09:25:43,066 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:25:43,110 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:25:43,110 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:25:43,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:25:43 BoogieIcfgContainer [2024-10-14 09:25:43,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:25:43,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:25:43,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:25:43,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:25:43,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:25:41" (1/3) ... [2024-10-14 09:25:43,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6163f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:25:43, skipping insertion in model container [2024-10-14 09:25:43,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:42" (2/3) ... [2024-10-14 09:25:43,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6163f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:25:43, skipping insertion in model container [2024-10-14 09:25:43,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:25:43" (3/3) ... [2024-10-14 09:25:43,121 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i [2024-10-14 09:25:43,137 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:25:43,137 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:25:43,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:25:43,208 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;@3a5dff9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:25:43,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:25:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 64 states have (on average 1.546875) internal successors, (99), 65 states have internal predecessors, (99), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 09:25:43,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-14 09:25:43,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:25:43,228 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:25:43,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:25:43,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:25:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1837082081, now seen corresponding path program 1 times [2024-10-14 09:25:43,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:25:43,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540940201] [2024-10-14 09:25:43,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:25:43,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:25:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:43,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:25:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:43,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:25:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:43,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:25:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:25:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:43,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:25:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:25:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:25:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:25:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:25:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:25:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:25:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:25:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:25:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:25:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:25:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:25:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:25:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:25:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 09:25:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:25:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:25:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:25:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 09:25:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:25:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:25:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:25:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:25:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:25:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:25:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:25:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 09:25:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:25:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 09:25:44,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:25:44,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540940201] [2024-10-14 09:25:44,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540940201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:25:44,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:25:44,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:25:44,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055670307] [2024-10-14 09:25:44,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:25:44,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:25:44,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:25:44,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:25:44,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:25:44,220 INFO L87 Difference]: Start difference. First operand has 99 states, 64 states have (on average 1.546875) internal successors, (99), 65 states have internal predecessors, (99), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:25:44,840 INFO L93 Difference]: Finished difference Result 472 states and 915 transitions. [2024-10-14 09:25:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:25:44,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-10-14 09:25:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:25:44,859 INFO L225 Difference]: With dead ends: 472 [2024-10-14 09:25:44,859 INFO L226 Difference]: Without dead ends: 374 [2024-10-14 09:25:44,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:25:44,867 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 410 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 09:25:44,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 552 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 09:25:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-14 09:25:44,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 214. [2024-10-14 09:25:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 147 states have (on average 1.4625850340136055) internal successors, (215), 147 states have internal predecessors, (215), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 09:25:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 343 transitions. [2024-10-14 09:25:44,950 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 343 transitions. Word has length 203 [2024-10-14 09:25:44,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:25:44,951 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 343 transitions. [2024-10-14 09:25:44,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 343 transitions. [2024-10-14 09:25:44,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-14 09:25:44,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:25:44,955 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:25:44,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:25:44,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:25:44,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:25:44,956 INFO L85 PathProgramCache]: Analyzing trace with hash 157062625, now seen corresponding path program 1 times [2024-10-14 09:25:44,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:25:44,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570004397] [2024-10-14 09:25:44,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:25:44,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:25:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:25:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:25:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:25:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:25:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:25:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:25:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:25:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:25:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:25:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:25:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:25:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:25:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:25:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:25:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:25:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:25:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:25:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:25:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 09:25:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:25:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:25:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:25:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 09:25:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:25:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:25:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:25:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:25:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:25:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:25:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:25:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 09:25:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:25:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 09:25:45,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:25:45,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570004397] [2024-10-14 09:25:45,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570004397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:25:45,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:25:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:25:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372858114] [2024-10-14 09:25:45,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:25:45,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:25:45,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:25:45,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:25:45,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:25:45,367 INFO L87 Difference]: Start difference. First operand 214 states and 343 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:45,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:25:45,773 INFO L93 Difference]: Finished difference Result 533 states and 849 transitions. [2024-10-14 09:25:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:25:45,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-10-14 09:25:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:25:45,779 INFO L225 Difference]: With dead ends: 533 [2024-10-14 09:25:45,779 INFO L226 Difference]: Without dead ends: 320 [2024-10-14 09:25:45,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:25:45,786 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 218 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:25:45,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 557 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:25:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-14 09:25:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 232. [2024-10-14 09:25:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 165 states have (on average 1.4787878787878788) internal successors, (244), 165 states have internal predecessors, (244), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 09:25:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 372 transitions. [2024-10-14 09:25:45,840 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 372 transitions. Word has length 203 [2024-10-14 09:25:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:25:45,842 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 372 transitions. [2024-10-14 09:25:45,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 372 transitions. [2024-10-14 09:25:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-14 09:25:45,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:25:45,848 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:25:45,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:25:45,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:25:45,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:25:45,849 INFO L85 PathProgramCache]: Analyzing trace with hash 164689121, now seen corresponding path program 1 times [2024-10-14 09:25:45,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:25:45,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291944554] [2024-10-14 09:25:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:25:45,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:25:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:25:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:25:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:25:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:25:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:25:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:25:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:25:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:25:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:25:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:25:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:25:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:25:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:25:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:25:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:25:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:25:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:25:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:25:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 09:25:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:25:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:25:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:25:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 09:25:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:25:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:25:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:25:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:25:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:25:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:25:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:25:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 09:25:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:25:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 09:25:46,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:25:46,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291944554] [2024-10-14 09:25:46,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291944554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:25:46,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:25:46,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:25:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196509722] [2024-10-14 09:25:46,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:25:46,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:25:46,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:25:46,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:25:46,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:25:46,615 INFO L87 Difference]: Start difference. First operand 232 states and 372 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:47,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:25:47,010 INFO L93 Difference]: Finished difference Result 502 states and 797 transitions. [2024-10-14 09:25:47,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:25:47,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-10-14 09:25:47,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:25:47,012 INFO L225 Difference]: With dead ends: 502 [2024-10-14 09:25:47,013 INFO L226 Difference]: Without dead ends: 271 [2024-10-14 09:25:47,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:25:47,016 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 193 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:25:47,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 353 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:25:47,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-14 09:25:47,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 214. [2024-10-14 09:25:47,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 147 states have (on average 1.4557823129251701) internal successors, (214), 147 states have internal predecessors, (214), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 09:25:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 342 transitions. [2024-10-14 09:25:47,046 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 342 transitions. Word has length 203 [2024-10-14 09:25:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:25:47,046 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 342 transitions. [2024-10-14 09:25:47,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 342 transitions. [2024-10-14 09:25:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 09:25:47,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:25:47,051 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:25:47,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 09:25:47,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:25:47,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:25:47,052 INFO L85 PathProgramCache]: Analyzing trace with hash -542176881, now seen corresponding path program 1 times [2024-10-14 09:25:47,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:25:47,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210903496] [2024-10-14 09:25:47,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:25:47,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:25:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:25:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:25:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:25:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:25:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:25:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:25:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:25:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:25:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:25:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:25:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:25:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:25:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:25:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:25:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:25:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:25:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:25:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:25:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 09:25:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:25:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:25:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:25:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 09:25:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:25:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:25:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:25:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:25:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:25:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:25:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:25:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 09:25:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:25:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 09:25:47,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:25:47,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210903496] [2024-10-14 09:25:47,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210903496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:25:47,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:25:47,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:25:47,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225079104] [2024-10-14 09:25:47,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:25:47,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:25:47,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:25:47,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:25:47,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:25:47,266 INFO L87 Difference]: Start difference. First operand 214 states and 342 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:25:47,629 INFO L93 Difference]: Finished difference Result 848 states and 1350 transitions. [2024-10-14 09:25:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:25:47,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-10-14 09:25:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:25:47,635 INFO L225 Difference]: With dead ends: 848 [2024-10-14 09:25:47,636 INFO L226 Difference]: Without dead ends: 752 [2024-10-14 09:25:47,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:25:47,638 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 479 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:25:47,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 674 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:25:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-14 09:25:47,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 237. [2024-10-14 09:25:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 170 states have (on average 1.4705882352941178) internal successors, (250), 170 states have internal predecessors, (250), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 09:25:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 378 transitions. [2024-10-14 09:25:47,674 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 378 transitions. Word has length 204 [2024-10-14 09:25:47,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:25:47,675 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 378 transitions. [2024-10-14 09:25:47,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:47,675 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 378 transitions. [2024-10-14 09:25:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 09:25:47,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:25:47,677 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:25:47,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:25:47,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:25:47,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:25:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash 468940369, now seen corresponding path program 1 times [2024-10-14 09:25:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:25:47,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358881363] [2024-10-14 09:25:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:25:47,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:25:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:25:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:25:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:25:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:25:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:25:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:25:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:25:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:25:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:25:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:25:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:25:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:25:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:25:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:25:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:25:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:25:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:25:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:25:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 09:25:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:25:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:25:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:25:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 09:25:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:25:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:25:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:25:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:25:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:25:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:25:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:25:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 09:25:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:25:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 09:25:47,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:25:47,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358881363] [2024-10-14 09:25:47,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358881363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:25:47,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:25:47,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 09:25:47,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111116871] [2024-10-14 09:25:47,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:25:47,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:25:47,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:25:47,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:25:47,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:25:47,911 INFO L87 Difference]: Start difference. First operand 237 states and 378 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:25:48,630 INFO L93 Difference]: Finished difference Result 898 states and 1431 transitions. [2024-10-14 09:25:48,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 09:25:48,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-10-14 09:25:48,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:25:48,635 INFO L225 Difference]: With dead ends: 898 [2024-10-14 09:25:48,635 INFO L226 Difference]: Without dead ends: 779 [2024-10-14 09:25:48,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2024-10-14 09:25:48,636 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 501 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 09:25:48,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 975 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 09:25:48,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-10-14 09:25:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 247. [2024-10-14 09:25:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 09:25:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 395 transitions. [2024-10-14 09:25:48,664 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 395 transitions. Word has length 204 [2024-10-14 09:25:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:25:48,664 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 395 transitions. [2024-10-14 09:25:48,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 395 transitions. [2024-10-14 09:25:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 09:25:48,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:25:48,666 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:25:48,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 09:25:48,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:25:48,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:25:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1451967825, now seen corresponding path program 1 times [2024-10-14 09:25:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:25:48,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442798849] [2024-10-14 09:25:48,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:25:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:25:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:25:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:25:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:25:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:25:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:25:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:25:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:25:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:25:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:25:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:25:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:25:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:25:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:25:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:25:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:25:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:25:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:25:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:25:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 09:25:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:25:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:25:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:25:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 09:25:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:25:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:25:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:25:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:25:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:25:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:25:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:25:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 09:25:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:25:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 09:25:48,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:25:48,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442798849] [2024-10-14 09:25:48,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442798849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:25:48,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:25:48,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:25:48,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246555091] [2024-10-14 09:25:48,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:25:48,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:25:48,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:25:48,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:25:48,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:25:48,829 INFO L87 Difference]: Start difference. First operand 247 states and 395 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:25:49,266 INFO L93 Difference]: Finished difference Result 725 states and 1153 transitions. [2024-10-14 09:25:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:25:49,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-10-14 09:25:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:25:49,271 INFO L225 Difference]: With dead ends: 725 [2024-10-14 09:25:49,271 INFO L226 Difference]: Without dead ends: 596 [2024-10-14 09:25:49,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:25:49,272 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 324 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:25:49,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 439 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:25:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-14 09:25:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 265. [2024-10-14 09:25:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 198 states have (on average 1.5) internal successors, (297), 198 states have internal predecessors, (297), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 09:25:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 425 transitions. [2024-10-14 09:25:49,303 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 425 transitions. Word has length 204 [2024-10-14 09:25:49,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:25:49,305 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 425 transitions. [2024-10-14 09:25:49,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 425 transitions. [2024-10-14 09:25:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 09:25:49,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:25:49,308 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:25:49,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 09:25:49,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:25:49,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:25:49,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1459594321, now seen corresponding path program 1 times [2024-10-14 09:25:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:25:49,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144409822] [2024-10-14 09:25:49,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:25:49,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:25:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:25:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:25:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:25:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:25:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:25:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:25:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:25:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:25:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:25:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:25:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:25:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:25:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:25:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:25:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:25:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:25:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:25:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:25:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 09:25:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:25:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:25:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:25:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 09:25:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:25:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:25:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:25:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:25:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:25:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:25:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:25:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 09:25:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:25:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 09:25:49,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:25:49,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144409822] [2024-10-14 09:25:49,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144409822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:25:49,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:25:49,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:25:49,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441092956] [2024-10-14 09:25:49,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:25:49,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:25:49,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:25:49,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:25:49,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:25:49,564 INFO L87 Difference]: Start difference. First operand 265 states and 425 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:25:49,926 INFO L93 Difference]: Finished difference Result 877 states and 1399 transitions. [2024-10-14 09:25:49,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:25:49,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-10-14 09:25:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:25:49,931 INFO L225 Difference]: With dead ends: 877 [2024-10-14 09:25:49,931 INFO L226 Difference]: Without dead ends: 613 [2024-10-14 09:25:49,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 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-14 09:25:49,934 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 347 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:25:49,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 408 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:25:49,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-10-14 09:25:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 249. [2024-10-14 09:25:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 182 states have (on average 1.478021978021978) internal successors, (269), 182 states have internal predecessors, (269), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 09:25:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 397 transitions. [2024-10-14 09:25:49,965 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 397 transitions. Word has length 204 [2024-10-14 09:25:49,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:25:49,965 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 397 transitions. [2024-10-14 09:25:49,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 397 transitions. [2024-10-14 09:25:49,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 09:25:49,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:25:49,968 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:25:49,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 09:25:49,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:25:49,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:25:49,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1831882221, now seen corresponding path program 1 times [2024-10-14 09:25:49,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:25:49,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853899330] [2024-10-14 09:25:49,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:25:49,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:25:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:25:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:25:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:25:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:25:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:25:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:25:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:25:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:25:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:25:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:25:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:25:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:25:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:25:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:25:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:25:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:25:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:25:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:25:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 09:25:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:25:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:25:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:25:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 09:25:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:25:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:25:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:25:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:25:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:25:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:25:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:25:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 09:25:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:25:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 09:25:50,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:25:50,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853899330] [2024-10-14 09:25:50,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853899330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:25:50,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:25:50,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 09:25:50,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176704443] [2024-10-14 09:25:50,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:25:50,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:25:50,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:25:50,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:25:50,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:25:50,216 INFO L87 Difference]: Start difference. First operand 249 states and 397 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:25:50,679 INFO L93 Difference]: Finished difference Result 730 states and 1163 transitions. [2024-10-14 09:25:50,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 09:25:50,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-10-14 09:25:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:25:50,683 INFO L225 Difference]: With dead ends: 730 [2024-10-14 09:25:50,683 INFO L226 Difference]: Without dead ends: 600 [2024-10-14 09:25:50,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 09:25:50,684 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 355 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 09:25:50,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 580 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 09:25:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-14 09:25:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 266. [2024-10-14 09:25:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 199 states have (on average 1.4974874371859297) internal successors, (298), 199 states have internal predecessors, (298), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 09:25:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 426 transitions. [2024-10-14 09:25:50,714 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 426 transitions. Word has length 204 [2024-10-14 09:25:50,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:25:50,714 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 426 transitions. [2024-10-14 09:25:50,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 426 transitions. [2024-10-14 09:25:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 09:25:50,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:25:50,716 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:25:50,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 09:25:50,716 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:25:50,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:25:50,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1824255725, now seen corresponding path program 1 times [2024-10-14 09:25:50,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:25:50,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154391031] [2024-10-14 09:25:50,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:25:50,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:25:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:25:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:25:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:25:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:25:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:25:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:25:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:25:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:25:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:25:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:25:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:25:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:25:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:25:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:25:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:25:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:25:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:25:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:25:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 09:25:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:25:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:25:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:25:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 09:25:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:25:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:25:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:25:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:25:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:25:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:25:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:25:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 09:25:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:25:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:25:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 09:25:50,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:25:50,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154391031] [2024-10-14 09:25:50,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154391031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:25:50,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:25:50,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 09:25:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467919258] [2024-10-14 09:25:50,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:25:50,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 09:25:50,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:25:50,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 09:25:50,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:25:50,895 INFO L87 Difference]: Start difference. First operand 266 states and 426 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:51,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:25:51,497 INFO L93 Difference]: Finished difference Result 944 states and 1507 transitions. [2024-10-14 09:25:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 09:25:51,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-10-14 09:25:51,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:25:51,501 INFO L225 Difference]: With dead ends: 944 [2024-10-14 09:25:51,501 INFO L226 Difference]: Without dead ends: 679 [2024-10-14 09:25:51,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 09:25:51,503 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 270 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 09:25:51,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 715 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 09:25:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-10-14 09:25:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 258. [2024-10-14 09:25:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 191 states have (on average 1.486910994764398) internal successors, (284), 191 states have internal predecessors, (284), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 09:25:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 412 transitions. [2024-10-14 09:25:51,531 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 412 transitions. Word has length 204 [2024-10-14 09:25:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:25:51,532 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 412 transitions. [2024-10-14 09:25:51,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:25:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 412 transitions. [2024-10-14 09:25:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 09:25:51,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:25:51,534 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:25:51,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 09:25:51,534 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:25:51,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:25:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1815443156, now seen corresponding path program 1 times [2024-10-14 09:25:51,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:25:51,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559258013] [2024-10-14 09:25:51,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:25:51,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:25:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:25:51,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6112343] [2024-10-14 09:25:51,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:25:51,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:25:51,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:25:51,615 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-14 09:25:51,619 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-14 09:25:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:25:51,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:25:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:25:51,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:25:51,928 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:25:51,929 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:25:51,949 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-14 09:25:52,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 09:25:52,138 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:25:52,262 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:25:52,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:25:52 BoogieIcfgContainer [2024-10-14 09:25:52,264 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:25:52,265 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:25:52,265 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:25:52,265 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:25:52,265 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:25:43" (3/4) ... [2024-10-14 09:25:52,267 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:25:52,268 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:25:52,268 INFO L158 Benchmark]: Toolchain (without parser) took 10280.24ms. Allocated memory was 161.5MB in the beginning and 295.7MB in the end (delta: 134.2MB). Free memory was 94.7MB in the beginning and 199.1MB in the end (delta: -104.3MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-10-14 09:25:52,268 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:25:52,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.10ms. Allocated memory is still 161.5MB. Free memory was 94.3MB in the beginning and 127.6MB in the end (delta: -33.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-10-14 09:25:52,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.02ms. Allocated memory is still 161.5MB. Free memory was 127.6MB in the beginning and 122.9MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:25:52,269 INFO L158 Benchmark]: Boogie Preprocessor took 84.01ms. Allocated memory is still 161.5MB. Free memory was 122.9MB in the beginning and 117.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 09:25:52,269 INFO L158 Benchmark]: RCFGBuilder took 583.83ms. Allocated memory is still 161.5MB. Free memory was 117.3MB in the beginning and 83.1MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 09:25:52,269 INFO L158 Benchmark]: TraceAbstraction took 9150.81ms. Allocated memory was 161.5MB in the beginning and 295.7MB in the end (delta: 134.2MB). Free memory was 82.4MB in the beginning and 200.1MB in the end (delta: -117.7MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-10-14 09:25:52,273 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 295.7MB. Free memory was 200.1MB in the beginning and 199.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 09:25:52,274 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.10ms. Allocated memory is still 161.5MB. Free memory was 94.3MB in the beginning and 127.6MB in the end (delta: -33.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.02ms. Allocated memory is still 161.5MB. Free memory was 127.6MB in the beginning and 122.9MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.01ms. Allocated memory is still 161.5MB. Free memory was 122.9MB in the beginning and 117.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 583.83ms. Allocated memory is still 161.5MB. Free memory was 117.3MB in the beginning and 83.1MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9150.81ms. Allocated memory was 161.5MB in the beginning and 295.7MB in the end (delta: 134.2MB). Free memory was 82.4MB in the beginning and 200.1MB in the end (delta: -117.7MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 295.7MB. Free memory was 200.1MB in the beginning and 199.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 194, overapproximation of someBinaryDOUBLEComparisonOperation at line 194. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 256; [L23] unsigned short int var_1_2 = 51640; [L24] unsigned short int var_1_3 = 5; [L25] float var_1_7 = 128.8; [L26] unsigned char var_1_8 = 2; [L27] float var_1_9 = 256.5; [L28] float var_1_10 = 7.25; [L29] signed char var_1_11 = 64; [L30] signed char var_1_12 = -16; [L31] double var_1_13 = 0.9; [L32] unsigned char var_1_14 = 1; [L33] double var_1_15 = 0.0; [L34] double var_1_16 = 1.275; [L35] unsigned short int var_1_17 = 8; [L36] unsigned short int var_1_18 = 35331; [L37] signed char var_1_19 = -128; [L38] double var_1_20 = 0.0; [L39] double var_1_21 = 0.0; [L40] signed char var_1_22 = -8; [L41] signed char var_1_23 = 50; [L42] signed char var_1_26 = 5; [L43] signed long int var_1_27 = 32; [L44] unsigned char var_1_28 = 64; [L45] signed char var_1_29 = 100; [L46] signed char var_1_30 = -1; [L47] signed char var_1_31 = 10; [L48] signed char var_1_32 = 5; [L49] signed char var_1_33 = 1; [L50] unsigned short int var_1_34 = 32; [L51] unsigned char var_1_35 = 1; [L52] signed long int var_1_36 = -8; [L53] unsigned char var_1_37 = 1; [L54] float last_1_var_1_10 = 7.25; [L55] double last_1_var_1_13 = 0.9; [L56] unsigned short int last_1_var_1_17 = 8; [L57] signed char last_1_var_1_19 = -128; [L198] isInitial = 1 [L199] FCALL initially() [L200] COND TRUE 1 [L201] CALL updateLastVariables() [L188] last_1_var_1_10 = var_1_10 [L189] last_1_var_1_13 = var_1_13 [L190] last_1_var_1_17 = var_1_17 [L191] last_1_var_1_19 = var_1_19 [L201] RET updateLastVariables() [L202] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L137] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L139] var_1_3 = __VERIFIER_nondet_ushort() [L140] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L140] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L141] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L141] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L142] var_1_8 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_9=513/2] [L143] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_9=513/2] [L144] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_9=513/2] [L144] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_9=513/2] [L145] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=513/2] [L145] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=513/2] [L146] var_1_9 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L147] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L148] var_1_12 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L149] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L150] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L150] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L151] var_1_14 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L152] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L153] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L153] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L154] var_1_15 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L155] RET assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L156] var_1_16 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L157] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L158] var_1_18 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_18 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L159] RET assume_abort_if_not(var_1_18 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L160] CALL assume_abort_if_not(var_1_18 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L160] RET assume_abort_if_not(var_1_18 <= 65534) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L161] var_1_20 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L162] RET assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L163] var_1_21 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L164] RET assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L165] var_1_22 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_22 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L166] RET assume_abort_if_not(var_1_22 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L167] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L167] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=5, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L168] var_1_26 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L169] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L170] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L170] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L171] var_1_30 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_30 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L172] RET assume_abort_if_not(var_1_30 >= -126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L173] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L173] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L174] var_1_31 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L176] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L176] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L177] var_1_33 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L178] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L179] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L179] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L180] var_1_35 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L181] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L182] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L182] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=1, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L183] var_1_37 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L184] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L185] CALL assume_abort_if_not(var_1_37 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L185] RET assume_abort_if_not(var_1_37 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L202] RET updateVariables() [L203] CALL step() [L61] signed long int stepLocal_2 = var_1_3 + last_1_var_1_19; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L62] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L73] COND TRUE var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16)) [L74] var_1_19 = ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=0, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L78] var_1_17 = (var_1_18 - var_1_3) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=29/4, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1] [L79] COND TRUE (var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10) [L80] var_1_10 = var_1_9 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L82] COND FALSE !(var_1_10 >= var_1_10) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=256, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L87] COND FALSE !((var_1_2 - var_1_3) > var_1_17) [L90] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L92] signed long int stepLocal_1 = var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))); [L93] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=98303, stepLocal_1=0, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L94] COND FALSE !((var_1_19 / var_1_8) < stepLocal_1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=98303, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L101] COND TRUE (~ (- var_1_17)) < var_1_1 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=98303, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L102] COND FALSE !(var_1_1 < -64) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=98303, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L106] COND FALSE !(var_1_17 > var_1_11) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=98303, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L109] COND TRUE var_1_17 <= (((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) < 0 ) ? -((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) : ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) [L110] var_1_28 = 4 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=98303, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=100, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L112] COND TRUE var_1_26 <= 16 [L113] var_1_29 = (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_31) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=98303, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L115] COND TRUE var_1_11 >= var_1_11 [L116] var_1_32 = ((((4) < (((((var_1_26) < ((var_1_31 - var_1_33))) ? (var_1_26) : ((var_1_31 - var_1_33)))))) ? (4) : (((((var_1_26) < ((var_1_31 - var_1_33))) ? (var_1_26) : ((var_1_31 - var_1_33))))))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=98303, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L120] EXPR var_1_11 & var_1_19 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=98303, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L120] EXPR (var_1_11 & var_1_19) ^ var_1_11 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=98303, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L120] EXPR var_1_11 & var_1_33 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=98303, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L120] COND FALSE !(((var_1_11 & var_1_19) ^ var_1_11) < (var_1_11 & var_1_33)) [L125] EXPR var_1_17 & (~ var_1_11) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=98303, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=-8, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L125] COND TRUE (var_1_17 & (~ var_1_11)) <= var_1_1 [L126] COND TRUE \read(var_1_35) [L127] var_1_36 = ((((var_1_11) > (((((var_1_1) < (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))) ? (var_1_1) : (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))))))) ? (var_1_11) : (((((var_1_1) < (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))) ? (var_1_1) : (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))))))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=98303, stepLocal_2=32639, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=64, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L203] RET step() [L204] CALL, EXPR property() [L194-L195] return ((((((((var_1_2 - var_1_3) > var_1_17) ? (var_1_1 == ((signed long int) (((((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) < (var_1_17)) ? ((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) : (var_1_17))))) : (var_1_1 == ((signed long int) 0))) && (((var_1_19 / var_1_8) < (var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))))) ? ((var_1_1 >= var_1_3) ? (var_1_7 == ((float) 0.75f)) : (var_1_7 == ((float) var_1_9))) : 1)) && (((var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10)) ? (var_1_10 == ((float) var_1_9)) : 1)) && ((var_1_10 >= var_1_10) ? ((var_1_9 < var_1_10) ? (var_1_11 == ((signed char) var_1_12)) : 1) : 1)) && (var_1_14 ? ((last_1_var_1_13 <= var_1_9) ? (var_1_13 == ((double) var_1_9)) : ((((((last_1_var_1_17) < ((var_1_2 * last_1_var_1_17))) ? (last_1_var_1_17) : ((var_1_2 * last_1_var_1_17)))) == (var_1_3 + last_1_var_1_19)) ? (var_1_13 == ((double) 8.75)) : (var_1_13 == ((double) (16.5 + ((var_1_15 - 49.35) - var_1_16)))))) : 1)) && (var_1_17 == ((unsigned short int) (var_1_18 - var_1_3)))) && ((var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16))) ? (var_1_19 == ((signed char) ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))))) : (var_1_19 == ((signed char) var_1_12))) ; [L204] RET, EXPR property() [L204] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=64, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=64, var_1_12=-1, var_1_13=9/10, var_1_14=0, var_1_17=0, var_1_18=-98305, var_1_19=0, var_1_1=0, var_1_22=0, var_1_23=50, var_1_26=0, var_1_27=32, var_1_28=4, var_1_29=0, var_1_2=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_35=1, var_1_36=64, var_1_37=0, var_1_3=98303, var_1_7=644/5, var_1_8=1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 10, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3097 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3097 mSDsluCounter, 5253 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2729 mSDsCounter, 289 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3096 IncrementalHoareTripleChecker+Invalid, 3385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 289 mSolverCounterUnsat, 2524 mSDtfsCounter, 3096 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=8, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 2802 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2241 NumberOfCodeBlocks, 2241 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1824 ConstructedInterpolants, 0 QuantifiedInterpolants, 4246 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 17856/17856 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-14 09:25:52,305 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-pe-co_file-37.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 586631ca404c1b537cc1b6f6da4a014826fc10fbc299a5b43a0d3245229f10ab --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:25:54,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:25:54,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:25:54,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:25:54,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:25:54,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:25:54,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:25:54,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:25:54,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:25:54,433 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:25:54,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:25:54,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:25:54,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:25:54,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:25:54,435 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:25:54,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:25:54,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:25:54,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:25:54,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:25:54,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:25:54,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:25:54,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:25:54,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:25:54,439 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:25:54,439 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:25:54,440 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:25:54,440 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:25:54,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:25:54,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:25:54,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:25:54,440 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:25:54,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:25:54,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:25:54,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:25:54,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:25:54,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:25:54,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:25:54,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:25:54,442 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:25:54,442 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:25:54,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:25:54,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:25:54,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:25:54,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:25:54,444 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:25:54,444 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 -> 586631ca404c1b537cc1b6f6da4a014826fc10fbc299a5b43a0d3245229f10ab [2024-10-14 09:25:54,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:25:54,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:25:54,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:25:54,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:25:54,759 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:25:54,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i [2024-10-14 09:25:56,085 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:25:56,262 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:25:56,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i [2024-10-14 09:25:56,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/144878088/34113134876d42b8baa23d3018f01cb6/FLAG341f2393e [2024-10-14 09:25:56,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/144878088/34113134876d42b8baa23d3018f01cb6 [2024-10-14 09:25:56,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:25:56,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:25:56,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:25:56,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:25:56,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:25:56,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:25:56" (1/1) ... [2024-10-14 09:25:56,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e5f82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56, skipping insertion in model container [2024-10-14 09:25:56,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:25:56" (1/1) ... [2024-10-14 09:25:56,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:25:56,466 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-pe-co_file-37.i[919,932] [2024-10-14 09:25:56,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:25:56,563 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:25:56,575 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-pe-co_file-37.i[919,932] [2024-10-14 09:25:56,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:25:56,658 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:25:56,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56 WrapperNode [2024-10-14 09:25:56,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:25:56,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:25:56,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:25:56,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:25:56,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56" (1/1) ... [2024-10-14 09:25:56,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56" (1/1) ... [2024-10-14 09:25:56,718 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-10-14 09:25:56,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:25:56,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:25:56,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:25:56,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:25:56,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56" (1/1) ... [2024-10-14 09:25:56,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56" (1/1) ... [2024-10-14 09:25:56,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56" (1/1) ... [2024-10-14 09:25:56,753 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-14 09:25:56,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56" (1/1) ... [2024-10-14 09:25:56,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56" (1/1) ... [2024-10-14 09:25:56,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56" (1/1) ... [2024-10-14 09:25:56,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56" (1/1) ... [2024-10-14 09:25:56,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56" (1/1) ... [2024-10-14 09:25:56,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56" (1/1) ... [2024-10-14 09:25:56,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:25:56,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:25:56,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:25:56,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:25:56,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56" (1/1) ... [2024-10-14 09:25:56,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:25:56,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:25:56,814 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-14 09:25:56,819 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-14 09:25:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:25:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:25:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:25:56,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:25:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:25:56,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:25:56,944 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:25:56,945 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:26:08,833 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 09:26:08,834 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:26:08,889 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:26:08,889 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:26:08,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:26:08 BoogieIcfgContainer [2024-10-14 09:26:08,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:26:08,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:26:08,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:26:08,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:26:08,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:25:56" (1/3) ... [2024-10-14 09:26:08,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3c5dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:26:08, skipping insertion in model container [2024-10-14 09:26:08,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:25:56" (2/3) ... [2024-10-14 09:26:08,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3c5dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:26:08, skipping insertion in model container [2024-10-14 09:26:08,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:26:08" (3/3) ... [2024-10-14 09:26:08,897 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-37.i [2024-10-14 09:26:08,912 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:26:08,912 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:26:08,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:26:08,976 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;@3619849c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:26:08,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:26:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 09:26:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 09:26:08,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:26:09,000 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:26:09,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:26:09,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:26:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1895562230, now seen corresponding path program 1 times [2024-10-14 09:26:09,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:26:09,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891587425] [2024-10-14 09:26:09,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:26:09,022 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-14 09:26:09,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:26:09,025 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-14 09:26:09,026 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-14 09:26:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:26:09,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 09:26:09,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:26:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 974 proven. 0 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2024-10-14 09:26:09,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:26:09,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:26:09,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891587425] [2024-10-14 09:26:09,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891587425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:26:09,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:26:09,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:26:09,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486837442] [2024-10-14 09:26:09,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:26:09,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:26:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:26:09,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:26:09,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:26:09,700 INFO L87 Difference]: Start difference. First operand has 86 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 09:26:13,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:26:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:26:13,880 INFO L93 Difference]: Finished difference Result 169 states and 312 transitions. [2024-10-14 09:26:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:26:13,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 199 [2024-10-14 09:26:13,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:26:13,943 INFO L225 Difference]: With dead ends: 169 [2024-10-14 09:26:13,943 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 09:26:13,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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-14 09:26:13,949 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:26:13,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-14 09:26:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 09:26:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-14 09:26:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 09:26:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 133 transitions. [2024-10-14 09:26:13,986 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 133 transitions. Word has length 199 [2024-10-14 09:26:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:26:13,987 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 133 transitions. [2024-10-14 09:26:13,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 09:26:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 133 transitions. [2024-10-14 09:26:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 09:26:13,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:26:13,992 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:26:14,012 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-14 09:26:14,193 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-14 09:26:14,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:26:14,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:26:14,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1844316110, now seen corresponding path program 1 times [2024-10-14 09:26:14,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:26:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762059772] [2024-10-14 09:26:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:26:14,195 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-14 09:26:14,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:26:14,197 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-14 09:26:14,209 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-14 09:26:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:26:14,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:26:14,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:26:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 768 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2024-10-14 09:26:24,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:26:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-14 09:26:27,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:26:27,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762059772] [2024-10-14 09:26:27,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762059772] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:26:27,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:26:27,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-14 09:26:27,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699678211] [2024-10-14 09:26:27,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:26:27,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 09:26:27,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:26:27,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 09:26:27,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:26:27,125 INFO L87 Difference]: Start difference. First operand 84 states and 133 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2024-10-14 09:26:33,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:26:36,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:26:39,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:26:44,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:26:48,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:26:52,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:26:52,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:26:52,190 INFO L93 Difference]: Finished difference Result 173 states and 270 transitions. [2024-10-14 09:26:52,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 09:26:52,248 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) Word has length 199 [2024-10-14 09:26:52,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:26:52,252 INFO L225 Difference]: With dead ends: 173 [2024-10-14 09:26:52,252 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 09:26:52,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2024-10-14 09:26:52,260 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 220 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 148 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2024-10-14 09:26:52,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 186 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 207 Invalid, 3 Unknown, 0 Unchecked, 23.7s Time] [2024-10-14 09:26:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 09:26:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2024-10-14 09:26:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 09:26:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2024-10-14 09:26:52,276 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 199 [2024-10-14 09:26:52,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:26:52,277 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2024-10-14 09:26:52,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2024-10-14 09:26:52,277 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2024-10-14 09:26:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-14 09:26:52,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:26:52,284 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:26:52,307 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-14 09:26:52,485 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-14 09:26:52,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:26:52,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:26:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash -469950058, now seen corresponding path program 1 times [2024-10-14 09:26:52,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:26:52,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103299165] [2024-10-14 09:26:52,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:26:52,487 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-14 09:26:52,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:26:52,489 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-14 09:26:52,490 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-14 09:26:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:26:53,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 09:26:53,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:26:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 09:26:53,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:26:53,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:26:53,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103299165] [2024-10-14 09:26:53,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103299165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:26:53,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:26:53,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:26:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549288795] [2024-10-14 09:26:53,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:26:53,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:26:53,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:26:53,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:26:53,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:26:53,106 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:26:57,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:26:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:26:57,916 INFO L93 Difference]: Finished difference Result 190 states and 290 transitions. [2024-10-14 09:26:57,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:26:57,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 200 [2024-10-14 09:26:57,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:26:57,922 INFO L225 Difference]: With dead ends: 190 [2024-10-14 09:26:57,922 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 09:26:57,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:26:57,928 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 53 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-14 09:26:57,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 235 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2024-10-14 09:26:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 09:26:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-10-14 09:26:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 60 states have internal predecessors, (76), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-14 09:26:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 154 transitions. [2024-10-14 09:26:57,943 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 154 transitions. Word has length 200 [2024-10-14 09:26:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:26:57,946 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 154 transitions. [2024-10-14 09:26:57,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 09:26:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 154 transitions. [2024-10-14 09:26:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-14 09:26:57,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:26:57,948 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:26:57,973 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 (4)] Forceful destruction successful, exit code 0 [2024-10-14 09:26:58,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:26:58,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:26:58,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:26:58,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1749813736, now seen corresponding path program 1 times [2024-10-14 09:26:58,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:26:58,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753616212] [2024-10-14 09:26:58,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:26:58,155 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-14 09:26:58,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:26:58,156 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:26:58,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 09:26:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:26:58,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 09:26:58,671 INFO L278 TraceCheckSpWp]: Computing forward predicates...