./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-ps-cn_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-ps-cn_file-97.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 579893d84f46c8d2fde614d8707111909e3c8246a011b38655166cd537241c66 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:59:45,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:59:45,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:59:45,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:59:45,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:59:45,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:59:45,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:59:45,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:59:45,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:59:45,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:59:45,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:59:45,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:59:45,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:59:45,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:59:45,508 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:59:45,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:59:45,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:59:45,508 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:59:45,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:59:45,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:59:45,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:59:45,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:59:45,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:59:45,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:59:45,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:59:45,514 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:59:45,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:59:45,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:59:45,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:59:45,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:59:45,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:59:45,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:59:45,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:59:45,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:59:45,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:59:45,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:59:45,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:59:45,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:59:45,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:59:45,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:59:45,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:59:45,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:59:45,518 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 -> 579893d84f46c8d2fde614d8707111909e3c8246a011b38655166cd537241c66 [2024-10-13 02:59:45,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:59:45,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:59:45,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:59:45,779 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:59:45,779 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:59:45,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-97.i [2024-10-13 02:59:47,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:59:47,539 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:59:47,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-97.i [2024-10-13 02:59:47,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a743a635e/92213687c08e46fab01dc6ef99df507f/FLAGd34c8a0f0 [2024-10-13 02:59:47,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a743a635e/92213687c08e46fab01dc6ef99df507f [2024-10-13 02:59:47,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:59:47,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:59:47,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:59:47,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:59:47,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:59:47,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:59:47" (1/1) ... [2024-10-13 02:59:47,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574d40fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47, skipping insertion in model container [2024-10-13 02:59:47,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:59:47" (1/1) ... [2024-10-13 02:59:47,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:59:47,786 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-ps-cn_file-97.i[919,932] [2024-10-13 02:59:47,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:59:47,922 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:59:47,934 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-ps-cn_file-97.i[919,932] [2024-10-13 02:59:47,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:59:47,995 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:59:47,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47 WrapperNode [2024-10-13 02:59:47,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:59:48,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:59:48,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:59:48,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:59:48,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47" (1/1) ... [2024-10-13 02:59:48,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47" (1/1) ... [2024-10-13 02:59:48,084 INFO L138 Inliner]: procedures = 26, calls = 58, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 334 [2024-10-13 02:59:48,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:59:48,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:59:48,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:59:48,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:59:48,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47" (1/1) ... [2024-10-13 02:59:48,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47" (1/1) ... [2024-10-13 02:59:48,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47" (1/1) ... [2024-10-13 02:59:48,125 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-13 02:59:48,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47" (1/1) ... [2024-10-13 02:59:48,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47" (1/1) ... [2024-10-13 02:59:48,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47" (1/1) ... [2024-10-13 02:59:48,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47" (1/1) ... [2024-10-13 02:59:48,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47" (1/1) ... [2024-10-13 02:59:48,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47" (1/1) ... [2024-10-13 02:59:48,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:59:48,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:59:48,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:59:48,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:59:48,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47" (1/1) ... [2024-10-13 02:59:48,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:59:48,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:59:48,222 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-13 02:59:48,225 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-13 02:59:48,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:59:48,274 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:59:48,275 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:59:48,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:59:48,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:59:48,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:59:48,396 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:59:48,401 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:59:49,018 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-13 02:59:49,018 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:59:49,064 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:59:49,065 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:59:49,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:59:49 BoogieIcfgContainer [2024-10-13 02:59:49,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:59:49,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:59:49,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:59:49,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:59:49,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:59:47" (1/3) ... [2024-10-13 02:59:49,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c12b953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:59:49, skipping insertion in model container [2024-10-13 02:59:49,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:47" (2/3) ... [2024-10-13 02:59:49,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c12b953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:59:49, skipping insertion in model container [2024-10-13 02:59:49,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:59:49" (3/3) ... [2024-10-13 02:59:49,077 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-97.i [2024-10-13 02:59:49,096 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:59:49,096 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:59:49,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:59:49,195 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;@38108c9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:59:49,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:59:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 91 states have internal predecessors, (133), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 02:59:49,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-13 02:59:49,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:59:49,222 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:59:49,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:59:49,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:59:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1529436592, now seen corresponding path program 1 times [2024-10-13 02:59:49,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:59:49,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748835689] [2024-10-13 02:59:49,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:59:49,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:59:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:59:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:59:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:59:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:59:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:59:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:59:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:59:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:59:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:59:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:59:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:59:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:59:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:59:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:59:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:59:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:59:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:59:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:59:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:59:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:59:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:59:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:59:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:59:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:59:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:59:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:59:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 02:59:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:59:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 02:59:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:59:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 02:59:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:59:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:59:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:59:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-13 02:59:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-13 02:59:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-13 02:59:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-13 02:59:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 02:59:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 02:59:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 02:59:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 02:59:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-13 02:59:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-13 02:59:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-13 02:59:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2024-10-13 02:59:49,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:59:49,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748835689] [2024-10-13 02:59:49,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748835689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:59:49,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:59:49,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:59:49,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587623390] [2024-10-13 02:59:49,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:59:49,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:59:49,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:59:49,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:59:49,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:59:49,974 INFO L87 Difference]: Start difference. First operand has 138 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 91 states have internal predecessors, (133), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-13 02:59:50,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:59:50,039 INFO L93 Difference]: Finished difference Result 273 states and 489 transitions. [2024-10-13 02:59:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:59:50,042 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) Word has length 274 [2024-10-13 02:59:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:59:50,054 INFO L225 Difference]: With dead ends: 273 [2024-10-13 02:59:50,054 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 02:59:50,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 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-13 02:59:50,063 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:59:50,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:59:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 02:59:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-13 02:59:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 89 states have internal predecessors, (126), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 02:59:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 216 transitions. [2024-10-13 02:59:50,144 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 216 transitions. Word has length 274 [2024-10-13 02:59:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:59:50,144 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 216 transitions. [2024-10-13 02:59:50,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-13 02:59:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 216 transitions. [2024-10-13 02:59:50,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-13 02:59:50,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:59:50,151 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:59:50,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:59:50,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:59:50,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:59:50,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1503280506, now seen corresponding path program 1 times [2024-10-13 02:59:50,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:59:50,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208591323] [2024-10-13 02:59:50,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:59:50,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:59:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:59:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:59:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:59:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:59:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:59:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:59:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:59:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:59:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:59:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:59:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:59:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:59:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:59:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:59:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:59:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:59:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:59:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:59:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:59:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:59:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:59:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:59:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:59:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:59:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:59:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:59:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 02:59:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:59:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 02:59:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:59:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 02:59:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:59:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:59:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:59:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-13 02:59:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-13 02:59:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-13 02:59:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-13 02:59:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 02:59:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 02:59:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 02:59:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 02:59:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-13 02:59:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-13 02:59:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-13 02:59:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2024-10-13 02:59:50,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:59:50,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208591323] [2024-10-13 02:59:50,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208591323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:59:50,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:59:50,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:59:50,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671274528] [2024-10-13 02:59:50,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:59:50,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:59:50,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:59:50,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:59:50,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:59:50,678 INFO L87 Difference]: Start difference. First operand 136 states and 216 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 02:59:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:59:50,759 INFO L93 Difference]: Finished difference Result 359 states and 568 transitions. [2024-10-13 02:59:50,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:59:50,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 274 [2024-10-13 02:59:50,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:59:50,768 INFO L225 Difference]: With dead ends: 359 [2024-10-13 02:59:50,769 INFO L226 Difference]: Without dead ends: 224 [2024-10-13 02:59:50,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 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-13 02:59:50,772 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 134 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:59:50,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 463 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:59:50,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-13 02:59:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2024-10-13 02:59:50,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 157 states have (on average 1.4522292993630572) internal successors, (228), 158 states have internal predecessors, (228), 61 states have call successors, (61), 2 states have call predecessors, (61), 2 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-13 02:59:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 350 transitions. [2024-10-13 02:59:50,812 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 350 transitions. Word has length 274 [2024-10-13 02:59:50,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:59:50,814 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 350 transitions. [2024-10-13 02:59:50,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 02:59:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 350 transitions. [2024-10-13 02:59:50,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-13 02:59:50,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:59:50,823 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:59:50,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:59:50,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:59:50,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:59:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1974038340, now seen corresponding path program 1 times [2024-10-13 02:59:50,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:59:50,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650637836] [2024-10-13 02:59:50,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:59:50,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:59:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:59:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:50,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:59:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:59:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:59:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:59:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:59:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:59:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:59:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:59:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:59:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:59:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:59:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:59:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:59:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:59:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:59:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:59:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:59:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:59:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:59:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:59:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:59:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:59:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:59:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:59:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:59:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 02:59:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:59:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 02:59:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:59:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 02:59:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:59:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:59:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:59:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-13 02:59:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-13 02:59:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-13 02:59:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-13 02:59:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 02:59:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 02:59:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 02:59:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 02:59:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-13 02:59:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-13 02:59:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-13 02:59:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2024-10-13 02:59:51,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:59:51,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650637836] [2024-10-13 02:59:51,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650637836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:59:51,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:59:51,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:59:51,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808901734] [2024-10-13 02:59:51,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:59:51,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:59:51,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:59:51,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:59:51,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:59:51,192 INFO L87 Difference]: Start difference. First operand 221 states and 350 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 02:59:51,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:59:51,297 INFO L93 Difference]: Finished difference Result 633 states and 1002 transitions. [2024-10-13 02:59:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:59:51,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 274 [2024-10-13 02:59:51,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:59:51,312 INFO L225 Difference]: With dead ends: 633 [2024-10-13 02:59:51,314 INFO L226 Difference]: Without dead ends: 413 [2024-10-13 02:59:51,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 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-13 02:59:51,317 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 203 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:59:51,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 566 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:59:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-13 02:59:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 263. [2024-10-13 02:59:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 199 states have (on average 1.4371859296482412) internal successors, (286), 200 states have internal predecessors, (286), 61 states have call successors, (61), 2 states have call predecessors, (61), 2 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-13 02:59:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 408 transitions. [2024-10-13 02:59:51,399 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 408 transitions. Word has length 274 [2024-10-13 02:59:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:59:51,401 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 408 transitions. [2024-10-13 02:59:51,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 02:59:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 408 transitions. [2024-10-13 02:59:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-13 02:59:51,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:59:51,407 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:59:51,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:59:51,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:59:51,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:59:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash 962921090, now seen corresponding path program 1 times [2024-10-13 02:59:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:59:51,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721962868] [2024-10-13 02:59:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:59:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:59:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:59:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:59:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:59:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:59:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:59:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:59:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:59:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:59:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:59:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:59:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:59:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:59:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:59:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:59:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:59:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:59:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:59:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:59:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:59:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:59:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:59:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:59:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:59:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:59:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:59:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:59:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 02:59:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:59:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 02:59:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:59:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 02:59:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:59:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:52,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:59:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:52,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:59:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:52,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-13 02:59:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:52,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-13 02:59:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:52,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-13 02:59:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:52,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-13 02:59:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:52,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 02:59:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:52,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 02:59:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:52,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 02:59:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:52,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 02:59:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:52,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-13 02:59:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:52,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-13 02:59:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:52,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-13 02:59:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2024-10-13 02:59:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:59:52,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721962868] [2024-10-13 02:59:52,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721962868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:59:52,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:59:52,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:59:52,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014174273] [2024-10-13 02:59:52,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:59:52,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:59:52,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:59:52,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:59:52,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:59:52,058 INFO L87 Difference]: Start difference. First operand 263 states and 408 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 02:59:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:59:52,593 INFO L93 Difference]: Finished difference Result 886 states and 1386 transitions. [2024-10-13 02:59:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:59:52,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 274 [2024-10-13 02:59:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:59:52,600 INFO L225 Difference]: With dead ends: 886 [2024-10-13 02:59:52,600 INFO L226 Difference]: Without dead ends: 624 [2024-10-13 02:59:52,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 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-13 02:59:52,603 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 323 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:59:52,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 763 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 02:59:52,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2024-10-13 02:59:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 511. [2024-10-13 02:59:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 384 states have (on average 1.421875) internal successors, (546), 386 states have internal predecessors, (546), 122 states have call successors, (122), 4 states have call predecessors, (122), 4 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2024-10-13 02:59:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 790 transitions. [2024-10-13 02:59:52,666 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 790 transitions. Word has length 274 [2024-10-13 02:59:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:59:52,667 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 790 transitions. [2024-10-13 02:59:52,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 02:59:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 790 transitions. [2024-10-13 02:59:52,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-10-13 02:59:52,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:59:52,671 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:59:52,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:59:52,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:59:52,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:59:52,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1242161264, now seen corresponding path program 1 times [2024-10-13 02:59:52,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:59:52,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212235367] [2024-10-13 02:59:52,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:59:52,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:59:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:59:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:59:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:59:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:59:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:59:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:59:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:59:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:59:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:59:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:59:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:59:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:59:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:59:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:59:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:59:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:59:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:59:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:59:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:59:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:59:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:59:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:59:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:59:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:59:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:59:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:59:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 02:59:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:59:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 02:59:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:59:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 02:59:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:59:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:59:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:59:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-13 02:59:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-13 02:59:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-13 02:59:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-13 02:59:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 02:59:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 02:59:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 02:59:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 02:59:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-13 02:59:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-13 02:59:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-13 02:59:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2024-10-13 02:59:53,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:59:53,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212235367] [2024-10-13 02:59:53,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212235367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:59:53,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:59:53,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 02:59:53,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098875082] [2024-10-13 02:59:53,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:59:53,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 02:59:53,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:59:53,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 02:59:53,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:59:53,393 INFO L87 Difference]: Start difference. First operand 511 states and 790 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 02:59:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:59:53,975 INFO L93 Difference]: Finished difference Result 1331 states and 2043 transitions. [2024-10-13 02:59:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:59:53,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 275 [2024-10-13 02:59:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:59:53,982 INFO L225 Difference]: With dead ends: 1331 [2024-10-13 02:59:53,982 INFO L226 Difference]: Without dead ends: 821 [2024-10-13 02:59:53,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-13 02:59:53,984 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 184 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:59:53,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 916 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 02:59:53,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-10-13 02:59:54,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 779. [2024-10-13 02:59:54,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 589 states have (on average 1.3786078098471986) internal successors, (812), 592 states have internal predecessors, (812), 183 states have call successors, (183), 6 states have call predecessors, (183), 6 states have return successors, (183), 180 states have call predecessors, (183), 183 states have call successors, (183) [2024-10-13 02:59:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1178 transitions. [2024-10-13 02:59:54,057 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1178 transitions. Word has length 275 [2024-10-13 02:59:54,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:59:54,058 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1178 transitions. [2024-10-13 02:59:54,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 02:59:54,058 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1178 transitions. [2024-10-13 02:59:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-13 02:59:54,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:59:54,062 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:59:54,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:59:54,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:59:54,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:59:54,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1319556330, now seen corresponding path program 1 times [2024-10-13 02:59:54,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:59:54,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447235750] [2024-10-13 02:59:54,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:59:54,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:59:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:59:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:59:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:59:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:59:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:59:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:59:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:59:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:59:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:59:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:59:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:59:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:59:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:59:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:59:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:59:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:59:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:59:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:59:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:59:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:59:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:59:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:59:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:59:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:59:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:59:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:59:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 02:59:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:59:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 02:59:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:59:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 02:59:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:59:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:59:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:59:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-13 02:59:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-13 02:59:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-13 02:59:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-13 02:59:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 02:59:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 02:59:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 02:59:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 02:59:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-13 02:59:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-13 02:59:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-13 02:59:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2024-10-13 02:59:54,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:59:54,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447235750] [2024-10-13 02:59:54,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447235750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:59:54,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:59:54,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:59:54,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509202538] [2024-10-13 02:59:54,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:59:54,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:59:54,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:59:54,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:59:54,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:59:54,458 INFO L87 Difference]: Start difference. First operand 779 states and 1178 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 02:59:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:59:55,020 INFO L93 Difference]: Finished difference Result 1372 states and 2102 transitions. [2024-10-13 02:59:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 02:59:55,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 276 [2024-10-13 02:59:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:59:55,028 INFO L225 Difference]: With dead ends: 1372 [2024-10-13 02:59:55,029 INFO L226 Difference]: Without dead ends: 1110 [2024-10-13 02:59:55,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:59:55,031 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 346 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:59:55,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1415 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 02:59:55,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2024-10-13 02:59:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 791. [2024-10-13 02:59:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 601 states have (on average 1.3810316139767056) internal successors, (830), 604 states have internal predecessors, (830), 183 states have call successors, (183), 6 states have call predecessors, (183), 6 states have return successors, (183), 180 states have call predecessors, (183), 183 states have call successors, (183) [2024-10-13 02:59:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1196 transitions. [2024-10-13 02:59:55,135 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1196 transitions. Word has length 276 [2024-10-13 02:59:55,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:59:55,135 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1196 transitions. [2024-10-13 02:59:55,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 02:59:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1196 transitions. [2024-10-13 02:59:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-13 02:59:55,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:59:55,140 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:59:55,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:59:55,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:59:55,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:59:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1077072585, now seen corresponding path program 1 times [2024-10-13 02:59:55,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:59:55,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28101133] [2024-10-13 02:59:55,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:59:55,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:59:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:59:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:59:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:59:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:59:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:59:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:59:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:59:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:59:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:59:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:59:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:59:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:59:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:59:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:59:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:59:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:59:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:59:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:59:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:59:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:59:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:59:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:59:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:59:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:59:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:59:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:59:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 02:59:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:59:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 02:59:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:59:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 02:59:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:59:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:59:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:59:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-13 02:59:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-13 02:59:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-13 02:59:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-13 02:59:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 02:59:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 02:59:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 02:59:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 02:59:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-13 02:59:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-13 02:59:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-13 02:59:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2024-10-13 02:59:55,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:59:55,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28101133] [2024-10-13 02:59:55,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28101133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:59:55,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:59:55,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:59:55,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979867660] [2024-10-13 02:59:55,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:59:55,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:59:55,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:59:55,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:59:55,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:59:55,663 INFO L87 Difference]: Start difference. First operand 791 states and 1196 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 02:59:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:59:55,808 INFO L93 Difference]: Finished difference Result 1692 states and 2571 transitions. [2024-10-13 02:59:55,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:59:55,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 276 [2024-10-13 02:59:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:59:55,815 INFO L225 Difference]: With dead ends: 1692 [2024-10-13 02:59:55,815 INFO L226 Difference]: Without dead ends: 902 [2024-10-13 02:59:55,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:59:55,819 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 191 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:59:55,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 884 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:59:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-13 02:59:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 791. [2024-10-13 02:59:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 601 states have (on average 1.3544093178036605) internal successors, (814), 604 states have internal predecessors, (814), 183 states have call successors, (183), 6 states have call predecessors, (183), 6 states have return successors, (183), 180 states have call predecessors, (183), 183 states have call successors, (183) [2024-10-13 02:59:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1180 transitions. [2024-10-13 02:59:55,992 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1180 transitions. Word has length 276 [2024-10-13 02:59:55,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:59:55,993 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1180 transitions. [2024-10-13 02:59:55,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 02:59:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1180 transitions. [2024-10-13 02:59:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-13 02:59:55,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:59:55,997 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:59:55,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 02:59:55,998 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:59:55,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:59:55,998 INFO L85 PathProgramCache]: Analyzing trace with hash -429245864, now seen corresponding path program 1 times [2024-10-13 02:59:55,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:59:55,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494863267] [2024-10-13 02:59:55,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:59:55,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:59:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:59:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:59:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:59:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:59:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:59:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:59:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:59:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:59:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:59:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:59:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:59:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:59:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:59:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:59:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:59:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:59:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:59:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:59:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:59:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:59:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:59:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:59:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:59:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:59:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:59:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:59:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 02:59:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:59:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 02:59:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:59:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 02:59:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:59:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:59:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:59:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-13 02:59:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-13 02:59:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-13 02:59:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-13 02:59:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 02:59:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 02:59:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 02:59:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 02:59:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-13 02:59:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-13 02:59:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-13 02:59:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2024-10-13 02:59:56,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:59:56,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494863267] [2024-10-13 02:59:56,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494863267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:59:56,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:59:56,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:59:56,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867729470] [2024-10-13 02:59:56,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:59:56,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:59:56,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:59:56,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:59:56,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:59:56,424 INFO L87 Difference]: Start difference. First operand 791 states and 1180 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 02:59:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:59:57,435 INFO L93 Difference]: Finished difference Result 2069 states and 3063 transitions. [2024-10-13 02:59:57,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 02:59:57,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 280 [2024-10-13 02:59:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:59:57,446 INFO L225 Difference]: With dead ends: 2069 [2024-10-13 02:59:57,446 INFO L226 Difference]: Without dead ends: 1795 [2024-10-13 02:59:57,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:59:57,448 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 444 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 02:59:57,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 909 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 02:59:57,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2024-10-13 02:59:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1351. [2024-10-13 02:59:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1035 states have (on average 1.3507246376811595) internal successors, (1398), 1040 states have internal predecessors, (1398), 305 states have call successors, (305), 10 states have call predecessors, (305), 10 states have return successors, (305), 300 states have call predecessors, (305), 305 states have call successors, (305) [2024-10-13 02:59:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 2008 transitions. [2024-10-13 02:59:57,688 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 2008 transitions. Word has length 280 [2024-10-13 02:59:57,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:59:57,689 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 2008 transitions. [2024-10-13 02:59:57,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 02:59:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2008 transitions. [2024-10-13 02:59:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-13 02:59:57,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:59:57,693 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:59:57,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 02:59:57,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:59:57,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:59:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1831082400, now seen corresponding path program 1 times [2024-10-13 02:59:57,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:59:57,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465949604] [2024-10-13 02:59:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:59:57,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:59:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:00:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 03:00:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 03:00:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 03:00:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:00:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:00:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:00:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:00:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:00:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:00:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:00:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:00:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:00:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:00:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:00:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:00:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:00:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:00:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:00:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 03:00:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:00:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:00:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:00:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:00:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:00:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 03:00:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 03:00:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 03:00:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 03:00:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:00:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 03:00:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 03:00:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 03:00:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 03:00:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-13 03:00:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-13 03:00:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-13 03:00:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-13 03:00:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-13 03:00:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 03:00:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 03:00:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 03:00:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-13 03:00:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-13 03:00:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-13 03:00:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2024-10-13 03:00:04,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:00:04,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465949604] [2024-10-13 03:00:04,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465949604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:00:04,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:00:04,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 03:00:04,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866347793] [2024-10-13 03:00:04,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:00:04,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 03:00:04,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:00:04,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 03:00:04,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:00:04,809 INFO L87 Difference]: Start difference. First operand 1351 states and 2008 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 03:00:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:00:07,329 INFO L93 Difference]: Finished difference Result 2733 states and 3935 transitions. [2024-10-13 03:00:07,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 03:00:07,331 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 280 [2024-10-13 03:00:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:00:07,342 INFO L225 Difference]: With dead ends: 2733 [2024-10-13 03:00:07,342 INFO L226 Difference]: Without dead ends: 2211 [2024-10-13 03:00:07,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-13 03:00:07,348 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 204 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:00:07,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 660 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 03:00:07,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2024-10-13 03:00:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2073. [2024-10-13 03:00:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2073 states, 1727 states have (on average 1.3398957730167922) internal successors, (2314), 1742 states have internal predecessors, (2314), 325 states have call successors, (325), 20 states have call predecessors, (325), 20 states have return successors, (325), 310 states have call predecessors, (325), 325 states have call successors, (325) [2024-10-13 03:00:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 2964 transitions. [2024-10-13 03:00:07,630 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 2964 transitions. Word has length 280 [2024-10-13 03:00:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:00:07,631 INFO L471 AbstractCegarLoop]: Abstraction has 2073 states and 2964 transitions. [2024-10-13 03:00:07,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 03:00:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 2964 transitions. [2024-10-13 03:00:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-13 03:00:07,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:00:07,635 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:00:07,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 03:00:07,636 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:00:07,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:00:07,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1612227682, now seen corresponding path program 1 times [2024-10-13 03:00:07,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:00:07,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465264497] [2024-10-13 03:00:07,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:00:07,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:00:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:00:07,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1981676810] [2024-10-13 03:00:07,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:00:07,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:00:07,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:00:07,735 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-13 03:00:07,738 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-13 03:00:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:00:07,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:00:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:00:08,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:00:08,230 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:00:08,231 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:00:08,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 03:00:08,433 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-13 03:00:08,437 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:00:08,630 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:00:08,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:00:08 BoogieIcfgContainer [2024-10-13 03:00:08,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:00:08,634 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:00:08,634 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:00:08,634 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:00:08,635 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:59:49" (3/4) ... [2024-10-13 03:00:08,637 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:00:08,638 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:00:08,638 INFO L158 Benchmark]: Toolchain (without parser) took 21071.60ms. Allocated memory was 180.4MB in the beginning and 419.4MB in the end (delta: 239.1MB). Free memory was 113.0MB in the beginning and 225.6MB in the end (delta: -112.6MB). Peak memory consumption was 127.3MB. Max. memory is 16.1GB. [2024-10-13 03:00:08,638 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory is still 60.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:00:08,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.33ms. Allocated memory is still 180.4MB. Free memory was 112.9MB in the beginning and 145.4MB in the end (delta: -32.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-10-13 03:00:08,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.04ms. Allocated memory is still 180.4MB. Free memory was 145.4MB in the beginning and 139.8MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 03:00:08,639 INFO L158 Benchmark]: Boogie Preprocessor took 98.17ms. Allocated memory is still 180.4MB. Free memory was 139.8MB in the beginning and 132.1MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 03:00:08,639 INFO L158 Benchmark]: RCFGBuilder took 879.90ms. Allocated memory is still 180.4MB. Free memory was 132.1MB in the beginning and 90.2MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-13 03:00:08,640 INFO L158 Benchmark]: TraceAbstraction took 19564.86ms. Allocated memory was 180.4MB in the beginning and 419.4MB in the end (delta: 239.1MB). Free memory was 89.5MB in the beginning and 225.6MB in the end (delta: -136.1MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2024-10-13 03:00:08,640 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 419.4MB. Free memory is still 225.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:00:08,641 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.16ms. Allocated memory is still 98.6MB. Free memory is still 60.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.33ms. Allocated memory is still 180.4MB. Free memory was 112.9MB in the beginning and 145.4MB in the end (delta: -32.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.04ms. Allocated memory is still 180.4MB. Free memory was 145.4MB in the beginning and 139.8MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.17ms. Allocated memory is still 180.4MB. Free memory was 139.8MB in the beginning and 132.1MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 879.90ms. Allocated memory is still 180.4MB. Free memory was 132.1MB in the beginning and 90.2MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19564.86ms. Allocated memory was 180.4MB in the beginning and 419.4MB in the end (delta: 239.1MB). Free memory was 89.5MB in the beginning and 225.6MB in the end (delta: -136.1MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 419.4MB. Free memory is still 225.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 225, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someUnaryDOUBLEoperation at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] unsigned char var_1_25 = 1; [L41] signed char var_1_26 = 50; [L42] signed char var_1_27 = 64; [L43] signed short int var_1_28 = 4; [L44] unsigned short int var_1_29 = 8; [L45] unsigned char var_1_30 = 16; [L46] unsigned short int var_1_31 = 8; [L47] unsigned short int var_1_32 = 2; [L48] unsigned short int var_1_33 = 48416; [L49] unsigned short int var_1_34 = 8; [L50] unsigned char var_1_35 = 4; [L51] unsigned char var_1_36 = 25; [L52] unsigned long int var_1_37 = 32; [L53] unsigned char var_1_38 = 8; [L54] double var_1_39 = -0.75; [L55] double var_1_40 = 31.75; [L56] double var_1_41 = 5.5; [L57] double var_1_42 = 32.5; [L58] signed char var_1_43 = 100; [L59] signed char var_1_44 = 50; [L60] signed char var_1_45 = 5; [L61] signed long int last_1_var_1_5 = 5; [L229] isInitial = 1 [L230] FCALL initially() [L231] COND TRUE 1 [L232] CALL updateLastVariables() [L222] last_1_var_1_5 = var_1_5 [L232] RET updateLastVariables() [L233] CALL updateVariables() [L150] var_1_9 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L151] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L152] var_1_10 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L153] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L154] var_1_11 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L156] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L156] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L157] var_1_12 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L159] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L160] var_1_13 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L162] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L162] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L163] var_1_14 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L165] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L165] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L166] var_1_18 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L167] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L168] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L169] var_1_19 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L170] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L171] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L171] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L172] var_1_23 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L173] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L174] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L174] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L175] var_1_25 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L176] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L177] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L177] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L178] var_1_26 = __VERIFIER_nondet_char() [L179] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L179] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L180] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L180] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=64, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L181] var_1_27 = __VERIFIER_nondet_char() [L182] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L182] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L183] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L183] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=4, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L184] var_1_28 = __VERIFIER_nondet_short() [L185] CALL assume_abort_if_not(var_1_28 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L185] RET assume_abort_if_not(var_1_28 >= -16383) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L186] CALL assume_abort_if_not(var_1_28 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L186] RET assume_abort_if_not(var_1_28 <= 16383) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=16, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L187] var_1_30 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L188] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L189] CALL assume_abort_if_not(var_1_30 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L189] RET assume_abort_if_not(var_1_30 <= 255) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L190] CALL assume_abort_if_not(var_1_30 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L190] RET assume_abort_if_not(var_1_30 != 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=8, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L191] var_1_31 = __VERIFIER_nondet_ushort() [L192] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L192] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L193] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L193] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=2, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L194] var_1_32 = __VERIFIER_nondet_ushort() [L195] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L195] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L196] CALL assume_abort_if_not(var_1_32 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L196] RET assume_abort_if_not(var_1_32 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=48416, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L197] var_1_33 = __VERIFIER_nondet_ushort() [L198] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L198] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L199] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L199] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=8, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L200] var_1_34 = __VERIFIER_nondet_ushort() [L201] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L201] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L202] CALL assume_abort_if_not(var_1_34 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L202] RET assume_abort_if_not(var_1_34 <= 32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L203] var_1_36 = __VERIFIER_nondet_uchar() [L204] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L204] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L205] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L205] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L206] var_1_39 = __VERIFIER_nondet_double() [L207] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L207] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L208] var_1_40 = __VERIFIER_nondet_double() [L209] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L209] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L210] var_1_41 = __VERIFIER_nondet_double() [L211] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L211] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L212] var_1_42 = __VERIFIER_nondet_double() [L213] CALL assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L213] RET assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L214] var_1_44 = __VERIFIER_nondet_char() [L215] CALL assume_abort_if_not(var_1_44 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L215] RET assume_abort_if_not(var_1_44 >= -1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L216] CALL assume_abort_if_not(var_1_44 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L216] RET assume_abort_if_not(var_1_44 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L217] var_1_45 = __VERIFIER_nondet_char() [L218] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L218] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L219] CALL assume_abort_if_not(var_1_45 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L219] RET assume_abort_if_not(var_1_45 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L233] RET updateVariables() [L234] CALL step() [L65] COND FALSE !(\read(var_1_25)) [L70] var_1_24 = ((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=8, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L72] COND TRUE (var_1_26 / var_1_30) < var_1_27 [L73] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L77] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L80] COND TRUE ((((var_1_32) < (var_1_35)) ? (var_1_32) : (var_1_35))) >= var_1_26 [L81] var_1_37 = var_1_29 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L83] COND FALSE !((var_1_39 * (var_1_40 - var_1_41)) >= var_1_42) [L90] var_1_38 = var_1_36 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L92] COND FALSE !(((((var_1_39) > (64.75f)) ? (var_1_39) : (64.75f))) <= var_1_40) [L99] var_1_43 = var_1_44 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L101] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L104] var_1_20 = var_1_8 [L105] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L106] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L109] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L110] COND FALSE !(\read(var_1_22)) [L117] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L119] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L120] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L121] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L122] COND FALSE !(\read(var_1_22)) [L129] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L134] signed long int stepLocal_4 = 256; [L135] unsigned char stepLocal_3 = var_1_22; [L136] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L137] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L140] COND FALSE !(stepLocal_3 || var_1_22) [L145] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L234] RET step() [L235] CALL, EXPR property() [L225] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L225] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L225] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L225] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L225] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L225] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L225-L226] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L235] RET, EXPR property() [L235] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=63, var_1_13=256, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=-16383, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=65540, var_1_33=32767, var_1_34=0, var_1_35=4, var_1_36=0, var_1_37=2, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 10, TraceHistogramMax: 45, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2029 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2029 mSDsluCounter, 6789 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4030 mSDsCounter, 635 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1508 IncrementalHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 635 mSolverCounterUnsat, 2759 mSDtfsCounter, 1508 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 917 GetRequests, 878 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2073occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 1320 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 3043 NumberOfCodeBlocks, 3043 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2474 ConstructedInterpolants, 0 QuantifiedInterpolants, 12318 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 35640/35640 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-13 03:00:08,751 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-ps-cn_file-97.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 579893d84f46c8d2fde614d8707111909e3c8246a011b38655166cd537241c66 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:00:11,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:00:11,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:00:11,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:00:11,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:00:11,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:00:11,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:00:11,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:00:11,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:00:11,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:00:11,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:00:11,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:00:11,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:00:11,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:00:11,164 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:00:11,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:00:11,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:00:11,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:00:11,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:00:11,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:00:11,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:00:11,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:00:11,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:00:11,167 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:00:11,167 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:00:11,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:00:11,168 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:00:11,168 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:00:11,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:00:11,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:00:11,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:00:11,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:00:11,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:00:11,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:00:11,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:00:11,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:00:11,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:00:11,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:00:11,179 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:00:11,179 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:00:11,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:00:11,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:00:11,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:00:11,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:00:11,181 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:00:11,181 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 -> 579893d84f46c8d2fde614d8707111909e3c8246a011b38655166cd537241c66 [2024-10-13 03:00:11,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:00:11,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:00:11,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:00:11,524 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:00:11,524 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:00:11,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-97.i [2024-10-13 03:00:13,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:00:13,289 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:00:13,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-97.i [2024-10-13 03:00:13,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8faad906/143585eab1b34c7089935ee745667062/FLAG815de1e10 [2024-10-13 03:00:13,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8faad906/143585eab1b34c7089935ee745667062 [2024-10-13 03:00:13,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:00:13,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:00:13,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:00:13,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:00:13,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:00:13,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:00:13" (1/1) ... [2024-10-13 03:00:13,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bcad674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13, skipping insertion in model container [2024-10-13 03:00:13,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:00:13" (1/1) ... [2024-10-13 03:00:13,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:00:13,569 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-ps-cn_file-97.i[919,932] [2024-10-13 03:00:13,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:00:13,698 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:00:13,712 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-ps-cn_file-97.i[919,932] [2024-10-13 03:00:13,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:00:13,808 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:00:13,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13 WrapperNode [2024-10-13 03:00:13,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:00:13,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:00:13,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:00:13,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:00:13,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13" (1/1) ... [2024-10-13 03:00:13,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13" (1/1) ... [2024-10-13 03:00:13,877 INFO L138 Inliner]: procedures = 27, calls = 58, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2024-10-13 03:00:13,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:00:13,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:00:13,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:00:13,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:00:13,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13" (1/1) ... [2024-10-13 03:00:13,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13" (1/1) ... [2024-10-13 03:00:13,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13" (1/1) ... [2024-10-13 03:00:13,929 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-13 03:00:13,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13" (1/1) ... [2024-10-13 03:00:13,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13" (1/1) ... [2024-10-13 03:00:13,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13" (1/1) ... [2024-10-13 03:00:13,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13" (1/1) ... [2024-10-13 03:00:13,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13" (1/1) ... [2024-10-13 03:00:13,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13" (1/1) ... [2024-10-13 03:00:13,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:00:13,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:00:13,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:00:13,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:00:13,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13" (1/1) ... [2024-10-13 03:00:13,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:00:13,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:00:14,011 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-13 03:00:14,019 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-13 03:00:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:00:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:00:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:00:14,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:00:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:00:14,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:00:14,172 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:00:14,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:00:22,987 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 03:00:22,988 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:00:23,055 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:00:23,055 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:00:23,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:00:23 BoogieIcfgContainer [2024-10-13 03:00:23,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:00:23,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:00:23,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:00:23,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:00:23,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:00:13" (1/3) ... [2024-10-13 03:00:23,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eda3984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:00:23, skipping insertion in model container [2024-10-13 03:00:23,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:00:13" (2/3) ... [2024-10-13 03:00:23,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eda3984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:00:23, skipping insertion in model container [2024-10-13 03:00:23,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:00:23" (3/3) ... [2024-10-13 03:00:23,068 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-97.i [2024-10-13 03:00:23,086 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:00:23,087 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:00:23,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:00:23,175 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;@22926a40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:00:23,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:00:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 03:00:23,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-13 03:00:23,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:00:23,199 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:00:23,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:00:23,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:00:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1990005725, now seen corresponding path program 1 times [2024-10-13 03:00:23,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:00:23,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872401005] [2024-10-13 03:00:23,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:00:23,218 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-13 03:00:23,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:00:23,222 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-13 03:00:23,226 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-13 03:00:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:23,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:00:23,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:00:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1540 proven. 0 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2024-10-13 03:00:23,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:00:23,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:00:23,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872401005] [2024-10-13 03:00:23,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872401005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:00:23,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:00:23,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:00:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597649124] [2024-10-13 03:00:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:00:23,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:00:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:00:23,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:00:23,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:00:23,856 INFO L87 Difference]: Start difference. First operand has 107 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-13 03:00:23,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:00:23,936 INFO L93 Difference]: Finished difference Result 211 states and 391 transitions. [2024-10-13 03:00:23,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:00:23,944 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 270 [2024-10-13 03:00:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:00:23,956 INFO L225 Difference]: With dead ends: 211 [2024-10-13 03:00:23,957 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 03:00:23,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 269 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-13 03:00:23,966 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:00:23,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:00:23,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 03:00:24,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-13 03:00:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 03:00:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 168 transitions. [2024-10-13 03:00:24,024 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 168 transitions. Word has length 270 [2024-10-13 03:00:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:00:24,025 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 168 transitions. [2024-10-13 03:00:24,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-13 03:00:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 168 transitions. [2024-10-13 03:00:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-13 03:00:24,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:00:24,032 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:00:24,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 03:00:24,233 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-13 03:00:24,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:00:24,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:00:24,234 INFO L85 PathProgramCache]: Analyzing trace with hash 207534867, now seen corresponding path program 1 times [2024-10-13 03:00:24,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:00:24,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768453011] [2024-10-13 03:00:24,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:00:24,236 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-13 03:00:24,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:00:24,239 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-13 03:00:24,240 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-13 03:00:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:24,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 03:00:24,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:00:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2024-10-13 03:00:24,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:00:24,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:00:24,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768453011] [2024-10-13 03:00:24,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768453011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:00:24,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:00:24,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:00:24,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061088632] [2024-10-13 03:00:24,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:00:24,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:00:24,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:00:24,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:00:24,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:00:24,879 INFO L87 Difference]: Start difference. First operand 105 states and 168 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 03:00:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:00:25,038 INFO L93 Difference]: Finished difference Result 266 states and 424 transitions. [2024-10-13 03:00:25,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:00:25,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 270 [2024-10-13 03:00:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:00:25,049 INFO L225 Difference]: With dead ends: 266 [2024-10-13 03:00:25,052 INFO L226 Difference]: Without dead ends: 162 [2024-10-13 03:00:25,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 268 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-13 03:00:25,055 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 86 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:00:25,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 366 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:00:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-13 03:00:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2024-10-13 03:00:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 96 states have internal predecessors, (132), 61 states have call successors, (61), 2 states have call predecessors, (61), 2 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-13 03:00:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 254 transitions. [2024-10-13 03:00:25,105 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 254 transitions. Word has length 270 [2024-10-13 03:00:25,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:00:25,106 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 254 transitions. [2024-10-13 03:00:25,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 03:00:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 254 transitions. [2024-10-13 03:00:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-13 03:00:25,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:00:25,115 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:00:25,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 03:00:25,316 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-13 03:00:25,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:00:25,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:00:25,318 INFO L85 PathProgramCache]: Analyzing trace with hash -813533487, now seen corresponding path program 1 times [2024-10-13 03:00:25,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:00:25,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249625544] [2024-10-13 03:00:25,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:00:25,319 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-13 03:00:25,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:00:25,323 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-13 03:00:25,325 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-13 03:00:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:25,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 03:00:25,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:00:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1814 proven. 87 refuted. 0 times theorem prover too weak. 2059 trivial. 0 not checked. [2024-10-13 03:00:27,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:00:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2024-10-13 03:00:29,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:00:29,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249625544] [2024-10-13 03:00:29,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249625544] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:00:29,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 03:00:29,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-13 03:00:29,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048755974] [2024-10-13 03:00:29,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 03:00:29,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:00:29,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:00:29,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:00:29,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:00:29,516 INFO L87 Difference]: Start difference. First operand 159 states and 254 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2024-10-13 03:00:31,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:00:31,368 INFO L93 Difference]: Finished difference Result 329 states and 513 transitions. [2024-10-13 03:00:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 03:00:31,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) Word has length 270 [2024-10-13 03:00:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:00:31,374 INFO L225 Difference]: With dead ends: 329 [2024-10-13 03:00:31,374 INFO L226 Difference]: Without dead ends: 171 [2024-10-13 03:00:31,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 532 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:00:31,377 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 162 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:00:31,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 223 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 03:00:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-13 03:00:31,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 156. [2024-10-13 03:00:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 59 states have call successors, (59), 3 states have call predecessors, (59), 3 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-13 03:00:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2024-10-13 03:00:31,423 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 270 [2024-10-13 03:00:31,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:00:31,424 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2024-10-13 03:00:31,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2024-10-13 03:00:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2024-10-13 03:00:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-13 03:00:31,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:00:31,429 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:00:31,447 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-13 03:00:31,629 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-13 03:00:31,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:00:31,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:00:31,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1206560497, now seen corresponding path program 1 times [2024-10-13 03:00:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:00:31,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210166633] [2024-10-13 03:00:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:00:31,632 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-13 03:00:31,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:00:31,636 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-13 03:00:31,637 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-13 03:00:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:32,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 03:00:32,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:00:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2024-10-13 03:00:35,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:00:35,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:00:35,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210166633] [2024-10-13 03:00:35,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210166633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:00:35,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:00:35,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:00:35,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46483318] [2024-10-13 03:00:35,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:00:35,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:00:35,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:00:35,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:00:35,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:00:35,148 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 03:00:36,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:00:36,648 INFO L93 Difference]: Finished difference Result 412 states and 636 transitions. [2024-10-13 03:00:36,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:00:36,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 270 [2024-10-13 03:00:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:00:36,656 INFO L225 Difference]: With dead ends: 412 [2024-10-13 03:00:36,657 INFO L226 Difference]: Without dead ends: 257 [2024-10-13 03:00:36,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:00:36,659 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 184 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:00:36,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 627 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 03:00:36,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-13 03:00:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 156. [2024-10-13 03:00:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 94 states have internal predecessors, (118), 59 states have call successors, (59), 3 states have call predecessors, (59), 3 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-13 03:00:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 236 transitions. [2024-10-13 03:00:36,697 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 236 transitions. Word has length 270 [2024-10-13 03:00:36,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:00:36,698 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 236 transitions. [2024-10-13 03:00:36,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 03:00:36,698 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 236 transitions. [2024-10-13 03:00:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-10-13 03:00:36,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:00:36,702 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:00:36,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 03:00:36,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:00:36,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:00:36,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:00:36,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1561353178, now seen corresponding path program 1 times [2024-10-13 03:00:36,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:00:36,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091399889] [2024-10-13 03:00:36,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:00:36,904 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-13 03:00:36,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:00:36,906 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:00:36,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 03:00:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:37,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 03:00:37,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:00:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2024-10-13 03:00:43,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:00:43,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:00:43,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091399889] [2024-10-13 03:00:43,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091399889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:00:43,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:00:43,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:00:43,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723153626] [2024-10-13 03:00:43,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:00:43,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:00:43,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:00:43,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:00:43,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:00:43,099 INFO L87 Difference]: Start difference. First operand 156 states and 236 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 03:00:44,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:00:44,189 INFO L93 Difference]: Finished difference Result 476 states and 717 transitions. [2024-10-13 03:00:44,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:00:44,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 271 [2024-10-13 03:00:44,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:00:44,196 INFO L225 Difference]: With dead ends: 476 [2024-10-13 03:00:44,196 INFO L226 Difference]: Without dead ends: 321 [2024-10-13 03:00:44,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:00:44,199 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 90 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 03:00:44,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 518 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 03:00:44,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-13 03:00:44,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 309. [2024-10-13 03:00:44,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 184 states have (on average 1.2608695652173914) internal successors, (232), 186 states have internal predecessors, (232), 118 states have call successors, (118), 6 states have call predecessors, (118), 6 states have return successors, (118), 116 states have call predecessors, (118), 118 states have call successors, (118) [2024-10-13 03:00:44,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 468 transitions. [2024-10-13 03:00:44,267 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 468 transitions. Word has length 271 [2024-10-13 03:00:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:00:44,268 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 468 transitions. [2024-10-13 03:00:44,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2024-10-13 03:00:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 468 transitions. [2024-10-13 03:00:44,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-10-13 03:00:44,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:00:44,275 INFO L215 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:00:44,297 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 (6)] Forceful destruction successful, exit code 0 [2024-10-13 03:00:44,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:00:44,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:00:44,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:00:44,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1155631472, now seen corresponding path program 1 times [2024-10-13 03:00:44,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:00:44,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783186535] [2024-10-13 03:00:44,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:00:44,477 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-13 03:00:44,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:00:44,481 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:00:44,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 03:00:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:00:45,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 03:00:45,376 INFO L278 TraceCheckSpWp]: Computing forward predicates...