./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-84.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 923c55cd47017cc93a25a3016e3f55fbf64dcf09203b0c245c78e75ea53bbbc0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:21:16,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:21:16,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:21:16,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:21:16,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:21:16,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:21:16,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:21:16,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:21:16,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:21:16,190 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:21:16,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:21:16,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:21:16,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:21:16,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:21:16,192 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:21:16,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:21:16,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:21:16,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:21:16,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:21:16,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:21:16,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:21:16,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:21:16,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:21:16,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:21:16,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:21:16,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:21:16,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:21:16,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:21:16,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:21:16,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:21:16,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:21:16,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:21:16,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:21:16,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:21:16,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:21:16,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:21:16,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:21:16,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:21:16,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:21:16,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:21:16,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:21:16,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:21:16,229 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 -> 923c55cd47017cc93a25a3016e3f55fbf64dcf09203b0c245c78e75ea53bbbc0 [2024-11-12 04:21:16,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:21:16,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:21:16,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:21:16,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:21:16,510 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:21:16,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i [2024-11-12 04:21:18,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:21:18,246 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:21:18,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i [2024-11-12 04:21:18,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2587ee08e/def5151709874579b9da6a6494a03038/FLAG3887db7bb [2024-11-12 04:21:18,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2587ee08e/def5151709874579b9da6a6494a03038 [2024-11-12 04:21:18,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:21:18,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:21:18,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:21:18,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:21:18,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:21:18,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:21:18" (1/1) ... [2024-11-12 04:21:18,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13e53244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18, skipping insertion in model container [2024-11-12 04:21:18,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:21:18" (1/1) ... [2024-11-12 04:21:18,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:21:18,480 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i[919,932] [2024-11-12 04:21:18,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:21:18,580 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:21:18,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i[919,932] [2024-11-12 04:21:18,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:21:18,666 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:21:18,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18 WrapperNode [2024-11-12 04:21:18,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:21:18,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:21:18,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:21:18,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:21:18,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18" (1/1) ... [2024-11-12 04:21:18,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18" (1/1) ... [2024-11-12 04:21:18,734 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 274 [2024-11-12 04:21:18,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:21:18,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:21:18,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:21:18,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:21:18,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18" (1/1) ... [2024-11-12 04:21:18,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18" (1/1) ... [2024-11-12 04:21:18,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18" (1/1) ... [2024-11-12 04:21:18,787 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:21:18,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18" (1/1) ... [2024-11-12 04:21:18,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18" (1/1) ... [2024-11-12 04:21:18,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18" (1/1) ... [2024-11-12 04:21:18,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18" (1/1) ... [2024-11-12 04:21:18,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18" (1/1) ... [2024-11-12 04:21:18,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18" (1/1) ... [2024-11-12 04:21:18,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:21:18,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:21:18,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:21:18,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:21:18,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18" (1/1) ... [2024-11-12 04:21:18,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:21:18,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:21:18,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:21:18,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:21:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:21:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:21:18,935 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:21:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:21:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:21:18,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:21:19,052 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:21:19,054 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:21:19,573 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-12 04:21:19,574 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:21:19,593 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:21:19,594 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:21:19,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:21:19 BoogieIcfgContainer [2024-11-12 04:21:19,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:21:19,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:21:19,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:21:19,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:21:19,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:21:18" (1/3) ... [2024-11-12 04:21:19,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2629f4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:21:19, skipping insertion in model container [2024-11-12 04:21:19,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:21:18" (2/3) ... [2024-11-12 04:21:19,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2629f4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:21:19, skipping insertion in model container [2024-11-12 04:21:19,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:21:19" (3/3) ... [2024-11-12 04:21:19,605 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i [2024-11-12 04:21:19,621 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:21:19,622 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:21:19,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:21:19,701 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;@22ad9ee6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:21:19,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:21:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 04:21:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-12 04:21:19,724 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:21:19,726 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:21:19,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:21:19,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:21:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2095802463, now seen corresponding path program 1 times [2024-11-12 04:21:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:21:19,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904062322] [2024-11-12 04:21:19,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:21:19,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:21:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:21:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:21:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:21:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:21:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:21:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:21:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:21:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:21:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:21:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:21:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:21:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:21:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:21:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:21:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:21:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:21:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:21:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:21:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 04:21:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:21:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 04:21:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 04:21:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:21:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 04:21:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 04:21:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 04:21:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 04:21:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 04:21:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 04:21:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 04:21:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 04:21:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 04:21:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 04:21:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 04:21:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 04:21:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 04:21:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 04:21:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-12 04:21:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 04:21:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 04:21:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-12 04:21:20,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:21:20,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904062322] [2024-11-12 04:21:20,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904062322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:21:20,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:21:20,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:21:20,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007286478] [2024-11-12 04:21:20,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:21:20,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:21:20,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:21:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:21:20,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:21:20,543 INFO L87 Difference]: Start difference. First operand has 122 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-12 04:21:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:21:20,589 INFO L93 Difference]: Finished difference Result 237 states and 422 transitions. [2024-11-12 04:21:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:21:20,591 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 253 [2024-11-12 04:21:20,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:21:20,602 INFO L225 Difference]: With dead ends: 237 [2024-11-12 04:21:20,602 INFO L226 Difference]: Without dead ends: 118 [2024-11-12 04:21:20,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:21:20,611 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:21:20,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:21:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-12 04:21:20,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-12 04:21:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 04:21:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 187 transitions. [2024-11-12 04:21:20,674 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 187 transitions. Word has length 253 [2024-11-12 04:21:20,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:21:20,675 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 187 transitions. [2024-11-12 04:21:20,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-12 04:21:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 187 transitions. [2024-11-12 04:21:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-12 04:21:20,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:21:20,685 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:21:20,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:21:20,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:21:20,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:21:20,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2003280297, now seen corresponding path program 1 times [2024-11-12 04:21:20,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:21:20,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223199361] [2024-11-12 04:21:20,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:21:20,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:21:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:21:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:21:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:21:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:21:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:21:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:21:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:21:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:21:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:21:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:20,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:21:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:21:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:21:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:21:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:21:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:21:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:21:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:21:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:21:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 04:21:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:21:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 04:21:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 04:21:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:21:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 04:21:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 04:21:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 04:21:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 04:21:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 04:21:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 04:21:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 04:21:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 04:21:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 04:21:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 04:21:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 04:21:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 04:21:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 04:21:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 04:21:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-12 04:21:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 04:21:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 04:21:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-12 04:21:21,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:21:21,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223199361] [2024-11-12 04:21:21,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223199361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:21:21,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:21:21,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:21:21,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133584608] [2024-11-12 04:21:21,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:21:21,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:21:21,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:21:21,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:21:21,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:21:21,214 INFO L87 Difference]: Start difference. First operand 118 states and 187 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:21:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:21:21,316 INFO L93 Difference]: Finished difference Result 230 states and 365 transitions. [2024-11-12 04:21:21,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:21:21,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 253 [2024-11-12 04:21:21,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:21:21,320 INFO L225 Difference]: With dead ends: 230 [2024-11-12 04:21:21,320 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 04:21:21,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:21:21,323 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:21:21,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 171 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:21:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 04:21:21,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-12 04:21:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 04:21:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 177 transitions. [2024-11-12 04:21:21,359 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 177 transitions. Word has length 253 [2024-11-12 04:21:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:21:21,361 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 177 transitions. [2024-11-12 04:21:21,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:21:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 177 transitions. [2024-11-12 04:21:21,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-12 04:21:21,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:21:21,371 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:21:21,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:21:21,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:21:21,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:21:21,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1690157102, now seen corresponding path program 1 times [2024-11-12 04:21:21,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:21:21,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027229533] [2024-11-12 04:21:21,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:21:21,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:21:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:21:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:21:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:21:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:21:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:21:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:21:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:21:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:21:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:21:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:21:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:21:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:21:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:21:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:21:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:21:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:21:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:21:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:21:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 04:21:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:21:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 04:21:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 04:21:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:21:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 04:21:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 04:21:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 04:21:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 04:21:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 04:21:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 04:21:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 04:21:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 04:21:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 04:21:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 04:21:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 04:21:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 04:21:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 04:21:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 04:21:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-12 04:21:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 04:21:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 04:21:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-12 04:21:25,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:21:25,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027229533] [2024-11-12 04:21:25,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027229533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:21:25,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:21:25,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 04:21:25,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14107657] [2024-11-12 04:21:25,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:21:25,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:21:25,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:21:25,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:21:25,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:21:25,966 INFO L87 Difference]: Start difference. First operand 115 states and 177 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:21:28,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:21:28,790 INFO L93 Difference]: Finished difference Result 411 states and 594 transitions. [2024-11-12 04:21:28,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 04:21:28,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 254 [2024-11-12 04:21:28,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:21:28,797 INFO L225 Difference]: With dead ends: 411 [2024-11-12 04:21:28,798 INFO L226 Difference]: Without dead ends: 299 [2024-11-12 04:21:28,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2024-11-12 04:21:28,800 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 374 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:21:28,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 828 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 04:21:28,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-12 04:21:28,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 167. [2024-11-12 04:21:28,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 123 states have internal predecessors, (168), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 04:21:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 252 transitions. [2024-11-12 04:21:28,842 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 252 transitions. Word has length 254 [2024-11-12 04:21:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:21:28,843 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 252 transitions. [2024-11-12 04:21:28,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:21:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2024-11-12 04:21:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-12 04:21:28,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:21:28,848 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:21:28,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:21:28,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:21:28,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:21:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1871446265, now seen corresponding path program 1 times [2024-11-12 04:21:28,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:21:28,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445169916] [2024-11-12 04:21:28,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:21:28,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:21:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:36,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:21:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:36,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:21:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:21:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:36,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:21:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:36,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:21:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:21:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:36,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:21:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:21:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:36,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:21:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:21:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:36,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:21:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:36,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:21:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:21:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:21:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:21:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:21:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:21:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:21:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 04:21:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:21:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 04:21:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 04:21:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:21:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 04:21:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 04:21:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 04:21:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 04:21:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 04:21:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 04:21:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 04:21:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 04:21:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 04:21:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 04:21:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 04:21:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 04:21:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:37,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 04:21:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:38,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 04:21:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:38,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-12 04:21:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:38,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 04:21:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:38,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 04:21:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-12 04:21:38,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:21:38,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445169916] [2024-11-12 04:21:38,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445169916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:21:38,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:21:38,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 04:21:38,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104050954] [2024-11-12 04:21:38,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:21:38,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 04:21:38,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:21:38,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 04:21:38,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-12 04:21:38,209 INFO L87 Difference]: Start difference. First operand 167 states and 252 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-12 04:21:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:21:44,397 INFO L93 Difference]: Finished difference Result 521 states and 752 transitions. [2024-11-12 04:21:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 04:21:44,398 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 255 [2024-11-12 04:21:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:21:44,404 INFO L225 Difference]: With dead ends: 521 [2024-11-12 04:21:44,405 INFO L226 Difference]: Without dead ends: 357 [2024-11-12 04:21:44,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2024-11-12 04:21:44,407 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 703 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-12 04:21:44,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 673 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-12 04:21:44,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-12 04:21:44,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 176. [2024-11-12 04:21:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 131 states have (on average 1.3893129770992367) internal successors, (182), 132 states have internal predecessors, (182), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 04:21:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 266 transitions. [2024-11-12 04:21:44,445 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 266 transitions. Word has length 255 [2024-11-12 04:21:44,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:21:44,447 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 266 transitions. [2024-11-12 04:21:44,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-12 04:21:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 266 transitions. [2024-11-12 04:21:44,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-12 04:21:44,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:21:44,453 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:21:44,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 04:21:44,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:21:44,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:21:44,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1722456453, now seen corresponding path program 1 times [2024-11-12 04:21:44,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:21:44,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849527088] [2024-11-12 04:21:44,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:21:44,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:21:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:45,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:21:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:45,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:21:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:21:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:45,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:21:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:21:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:45,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:21:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:45,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:21:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:45,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:21:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:45,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:21:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:45,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:21:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:21:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:45,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:21:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:45,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:21:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:45,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:21:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:21:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:21:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:21:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:21:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 04:21:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:21:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 04:21:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 04:21:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:21:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 04:21:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 04:21:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 04:21:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 04:21:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 04:21:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 04:21:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 04:21:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 04:21:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 04:21:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 04:21:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 04:21:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 04:21:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 04:21:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 04:21:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-12 04:21:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 04:21:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 04:21:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-12 04:21:46,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:21:46,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849527088] [2024-11-12 04:21:46,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849527088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:21:46,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:21:46,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:21:46,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460815447] [2024-11-12 04:21:46,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:21:46,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:21:46,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:21:46,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:21:46,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:21:46,045 INFO L87 Difference]: Start difference. First operand 176 states and 266 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:21:46,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:21:46,862 INFO L93 Difference]: Finished difference Result 420 states and 623 transitions. [2024-11-12 04:21:46,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:21:46,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 255 [2024-11-12 04:21:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:21:46,868 INFO L225 Difference]: With dead ends: 420 [2024-11-12 04:21:46,869 INFO L226 Difference]: Without dead ends: 247 [2024-11-12 04:21:46,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:21:46,871 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 41 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 04:21:46,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 745 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 04:21:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-12 04:21:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 222. [2024-11-12 04:21:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 169 states have (on average 1.3431952662721893) internal successors, (227), 172 states have internal predecessors, (227), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 04:21:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 323 transitions. [2024-11-12 04:21:46,901 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 323 transitions. Word has length 255 [2024-11-12 04:21:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:21:46,902 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 323 transitions. [2024-11-12 04:21:46,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:21:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 323 transitions. [2024-11-12 04:21:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-12 04:21:46,905 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:21:46,906 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:21:46,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 04:21:46,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:21:46,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:21:46,906 INFO L85 PathProgramCache]: Analyzing trace with hash -610877799, now seen corresponding path program 1 times [2024-11-12 04:21:46,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:21:46,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806602371] [2024-11-12 04:21:46,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:21:46,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:21:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:21:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:21:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:21:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:21:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:21:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:21:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:21:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:21:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:21:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:21:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:21:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:21:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:21:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:21:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:21:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:21:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:21:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:21:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 04:21:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:21:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 04:21:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 04:21:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:21:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 04:21:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 04:21:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 04:21:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 04:21:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 04:21:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 04:21:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 04:21:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 04:21:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 04:21:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 04:21:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 04:21:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 04:21:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 04:21:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 04:21:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-12 04:21:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 04:21:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 04:21:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-12 04:21:50,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:21:50,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806602371] [2024-11-12 04:21:50,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806602371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:21:50,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:21:50,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 04:21:50,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046074556] [2024-11-12 04:21:50,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:21:50,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 04:21:50,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:21:50,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 04:21:50,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:21:50,896 INFO L87 Difference]: Start difference. First operand 222 states and 323 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:21:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:21:51,895 INFO L93 Difference]: Finished difference Result 479 states and 690 transitions. [2024-11-12 04:21:51,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:21:51,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 255 [2024-11-12 04:21:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:21:51,900 INFO L225 Difference]: With dead ends: 479 [2024-11-12 04:21:51,901 INFO L226 Difference]: Without dead ends: 260 [2024-11-12 04:21:51,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:21:51,902 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 44 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 04:21:51,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 873 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 04:21:51,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-12 04:21:51,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 222. [2024-11-12 04:21:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 169 states have (on average 1.3431952662721893) internal successors, (227), 172 states have internal predecessors, (227), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 04:21:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 323 transitions. [2024-11-12 04:21:51,934 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 323 transitions. Word has length 255 [2024-11-12 04:21:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:21:51,935 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 323 transitions. [2024-11-12 04:21:51,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:21:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 323 transitions. [2024-11-12 04:21:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-12 04:21:51,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:21:51,940 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:21:51,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 04:21:51,941 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:21:51,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:21:51,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1971907669, now seen corresponding path program 1 times [2024-11-12 04:21:51,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:21:51,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302151518] [2024-11-12 04:21:51,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:21:51,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:21:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:21:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:21:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:21:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:21:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:21:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:21:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:21:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:21:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:21:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:21:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:21:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:21:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:21:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:21:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:21:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:21:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:21:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:21:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 04:21:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:21:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 04:21:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 04:21:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:21:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 04:21:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 04:21:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 04:21:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 04:21:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 04:21:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 04:21:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 04:21:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 04:21:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 04:21:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 04:21:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 04:21:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 04:21:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 04:21:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 04:21:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-12 04:21:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 04:21:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 04:21:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-12 04:21:52,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:21:52,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302151518] [2024-11-12 04:21:52,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302151518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:21:52,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:21:52,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:21:52,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039724584] [2024-11-12 04:21:52,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:21:52,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:21:52,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:21:52,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:21:52,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:21:52,542 INFO L87 Difference]: Start difference. First operand 222 states and 323 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:21:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:21:52,755 INFO L93 Difference]: Finished difference Result 479 states and 687 transitions. [2024-11-12 04:21:52,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:21:52,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 255 [2024-11-12 04:21:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:21:52,758 INFO L225 Difference]: With dead ends: 479 [2024-11-12 04:21:52,758 INFO L226 Difference]: Without dead ends: 260 [2024-11-12 04:21:52,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:21:52,760 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 72 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:21:52,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 679 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:21:52,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-12 04:21:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 189. [2024-11-12 04:21:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 138 states have (on average 1.326086956521739) internal successors, (183), 140 states have internal predecessors, (183), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-12 04:21:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 275 transitions. [2024-11-12 04:21:52,783 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 275 transitions. Word has length 255 [2024-11-12 04:21:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:21:52,784 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 275 transitions. [2024-11-12 04:21:52,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:21:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 275 transitions. [2024-11-12 04:21:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-12 04:21:52,786 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:21:52,786 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:21:52,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 04:21:52,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:21:52,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:21:52,787 INFO L85 PathProgramCache]: Analyzing trace with hash -952498931, now seen corresponding path program 1 times [2024-11-12 04:21:52,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:21:52,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87862160] [2024-11-12 04:21:52,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:21:52,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:21:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:21:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:21:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:21:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:21:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:21:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:21:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:21:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:21:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:21:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:21:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:21:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:21:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:21:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:21:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:21:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:21:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:21:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:21:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 04:21:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:21:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 04:21:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 04:21:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:21:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 04:21:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 04:21:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 04:21:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 04:21:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 04:21:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 04:21:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 04:21:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 04:21:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 04:21:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 04:21:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 04:21:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 04:21:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 04:21:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 04:21:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-12 04:21:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 04:21:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 04:21:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-12 04:21:55,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:21:55,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87862160] [2024-11-12 04:21:55,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87862160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:21:55,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:21:55,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 04:21:55,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866971303] [2024-11-12 04:21:55,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:21:55,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 04:21:55,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:21:55,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 04:21:55,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:21:55,478 INFO L87 Difference]: Start difference. First operand 189 states and 275 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:21:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:21:56,340 INFO L93 Difference]: Finished difference Result 472 states and 677 transitions. [2024-11-12 04:21:56,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 04:21:56,343 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 256 [2024-11-12 04:21:56,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:21:56,345 INFO L225 Difference]: With dead ends: 472 [2024-11-12 04:21:56,346 INFO L226 Difference]: Without dead ends: 286 [2024-11-12 04:21:56,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-12 04:21:56,349 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 118 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 04:21:56,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1081 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 04:21:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-12 04:21:56,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 219. [2024-11-12 04:21:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 168 states have (on average 1.3333333333333333) internal successors, (224), 170 states have internal predecessors, (224), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-12 04:21:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2024-11-12 04:21:56,380 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 256 [2024-11-12 04:21:56,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:21:56,383 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2024-11-12 04:21:56,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:21:56,384 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2024-11-12 04:21:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-12 04:21:56,386 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:21:56,387 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:21:56,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 04:21:56,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:21:56,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:21:56,388 INFO L85 PathProgramCache]: Analyzing trace with hash -251434353, now seen corresponding path program 1 times [2024-11-12 04:21:56,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:21:56,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348283423] [2024-11-12 04:21:56,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:21:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:21:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:59,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:21:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:59,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:21:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:59,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:21:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:59,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:21:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:59,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:21:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:59,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:21:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:59,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:21:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:21:59,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:22:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:22:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:22:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:22:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:22:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:22:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:22:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:22:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 04:22:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:22:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 04:22:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 04:22:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:22:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 04:22:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 04:22:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 04:22:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 04:22:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 04:22:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 04:22:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 04:22:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 04:22:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 04:22:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 04:22:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 04:22:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 04:22:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 04:22:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 04:22:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-12 04:22:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 04:22:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 04:22:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-12 04:22:00,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:00,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348283423] [2024-11-12 04:22:00,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348283423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:00,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:00,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 04:22:00,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441082988] [2024-11-12 04:22:00,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:00,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 04:22:00,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:00,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 04:22:00,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-12 04:22:00,145 INFO L87 Difference]: Start difference. First operand 219 states and 316 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:22:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:01,342 INFO L93 Difference]: Finished difference Result 517 states and 737 transitions. [2024-11-12 04:22:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 04:22:01,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 256 [2024-11-12 04:22:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:01,345 INFO L225 Difference]: With dead ends: 517 [2024-11-12 04:22:01,346 INFO L226 Difference]: Without dead ends: 301 [2024-11-12 04:22:01,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-11-12 04:22:01,348 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 331 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:01,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 541 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 04:22:01,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-12 04:22:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 223. [2024-11-12 04:22:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 172 states have (on average 1.3372093023255813) internal successors, (230), 174 states have internal predecessors, (230), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-12 04:22:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 322 transitions. [2024-11-12 04:22:01,379 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 322 transitions. Word has length 256 [2024-11-12 04:22:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:01,380 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 322 transitions. [2024-11-12 04:22:01,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:22:01,381 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 322 transitions. [2024-11-12 04:22:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-12 04:22:01,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:01,385 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:01,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 04:22:01,386 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:01,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:01,386 INFO L85 PathProgramCache]: Analyzing trace with hash -838240367, now seen corresponding path program 1 times [2024-11-12 04:22:01,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:01,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286821169] [2024-11-12 04:22:01,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:01,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:22:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:22:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:22:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:22:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:22:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:22:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:22:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:22:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:22:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:22:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:22:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:22:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:22:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:22:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:22:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 04:22:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:22:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 04:22:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 04:22:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:22:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 04:22:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 04:22:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 04:22:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 04:22:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 04:22:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 04:22:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 04:22:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 04:22:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 04:22:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 04:22:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 04:22:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 04:22:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 04:22:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 04:22:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-12 04:22:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 04:22:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 04:22:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-12 04:22:04,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:04,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286821169] [2024-11-12 04:22:04,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286821169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:04,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:04,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 04:22:04,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315729778] [2024-11-12 04:22:04,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:04,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 04:22:04,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:04,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 04:22:04,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:22:04,279 INFO L87 Difference]: Start difference. First operand 223 states and 322 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:22:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:05,724 INFO L93 Difference]: Finished difference Result 515 states and 735 transitions. [2024-11-12 04:22:05,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 04:22:05,724 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 256 [2024-11-12 04:22:05,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:05,726 INFO L225 Difference]: With dead ends: 515 [2024-11-12 04:22:05,726 INFO L226 Difference]: Without dead ends: 295 [2024-11-12 04:22:05,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-12 04:22:05,728 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 121 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:05,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1248 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 04:22:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-12 04:22:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 219. [2024-11-12 04:22:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 168 states have (on average 1.3333333333333333) internal successors, (224), 170 states have internal predecessors, (224), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-12 04:22:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2024-11-12 04:22:05,763 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 256 [2024-11-12 04:22:05,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:05,763 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2024-11-12 04:22:05,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:22:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2024-11-12 04:22:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-12 04:22:05,766 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:05,766 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:05,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 04:22:05,766 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:05,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:05,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1340598156, now seen corresponding path program 1 times [2024-11-12 04:22:05,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:05,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855609447] [2024-11-12 04:22:05,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:05,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:05,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:22:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:05,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:22:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:05,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:22:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:05,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:22:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:05,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:22:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:05,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:22:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:05,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:22:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:05,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:05,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:22:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:05,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:05,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:22:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:22:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:22:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:22:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:22:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:22:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:22:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 04:22:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:22:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 04:22:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 04:22:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:22:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 04:22:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 04:22:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 04:22:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 04:22:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 04:22:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 04:22:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 04:22:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 04:22:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 04:22:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 04:22:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 04:22:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 04:22:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 04:22:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 04:22:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-12 04:22:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 04:22:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 04:22:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-12 04:22:06,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:06,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855609447] [2024-11-12 04:22:06,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855609447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:06,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:06,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 04:22:06,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415023027] [2024-11-12 04:22:06,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:06,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:22:06,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:06,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:22:06,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:22:06,083 INFO L87 Difference]: Start difference. First operand 219 states and 316 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:22:06,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:06,297 INFO L93 Difference]: Finished difference Result 623 states and 901 transitions. [2024-11-12 04:22:06,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:22:06,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 257 [2024-11-12 04:22:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:06,302 INFO L225 Difference]: With dead ends: 623 [2024-11-12 04:22:06,302 INFO L226 Difference]: Without dead ends: 407 [2024-11-12 04:22:06,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:22:06,303 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 121 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:06,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 592 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:22:06,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-12 04:22:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 305. [2024-11-12 04:22:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 211 states have (on average 1.2985781990521328) internal successors, (274), 213 states have internal predecessors, (274), 86 states have call successors, (86), 7 states have call predecessors, (86), 7 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-12 04:22:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 446 transitions. [2024-11-12 04:22:06,352 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 446 transitions. Word has length 257 [2024-11-12 04:22:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:06,353 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 446 transitions. [2024-11-12 04:22:06,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:22:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 446 transitions. [2024-11-12 04:22:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-12 04:22:06,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:06,355 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:06,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 04:22:06,355 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:06,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:06,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1320964054, now seen corresponding path program 1 times [2024-11-12 04:22:06,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:06,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74830586] [2024-11-12 04:22:06,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:06,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:22:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:22:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:22:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:22:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:22:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:22:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:22:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:22:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:22:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:22:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:22:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:22:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:22:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:22:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:22:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 04:22:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:22:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 04:22:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 04:22:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:22:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 04:22:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 04:22:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 04:22:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 04:22:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 04:22:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 04:22:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 04:22:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 04:22:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 04:22:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 04:22:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 04:22:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 04:22:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 04:22:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 04:22:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-12 04:22:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 04:22:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 04:22:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-12 04:22:06,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:06,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74830586] [2024-11-12 04:22:06,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74830586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:06,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:06,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:22:06,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38692664] [2024-11-12 04:22:06,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:06,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:22:06,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:06,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:22:06,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:06,522 INFO L87 Difference]: Start difference. First operand 305 states and 446 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:22:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:06,630 INFO L93 Difference]: Finished difference Result 551 states and 796 transitions. [2024-11-12 04:22:06,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:22:06,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 257 [2024-11-12 04:22:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:06,634 INFO L225 Difference]: With dead ends: 551 [2024-11-12 04:22:06,634 INFO L226 Difference]: Without dead ends: 335 [2024-11-12 04:22:06,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:06,636 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 39 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:06,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 300 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:22:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-12 04:22:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 312. [2024-11-12 04:22:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 218 states have (on average 1.2844036697247707) internal successors, (280), 220 states have internal predecessors, (280), 86 states have call successors, (86), 7 states have call predecessors, (86), 7 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-12 04:22:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 452 transitions. [2024-11-12 04:22:06,683 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 452 transitions. Word has length 257 [2024-11-12 04:22:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:06,683 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 452 transitions. [2024-11-12 04:22:06,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:22:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 452 transitions. [2024-11-12 04:22:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-12 04:22:06,685 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:06,685 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:06,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 04:22:06,685 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:06,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:06,686 INFO L85 PathProgramCache]: Analyzing trace with hash -707789790, now seen corresponding path program 1 times [2024-11-12 04:22:06,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:06,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590500562] [2024-11-12 04:22:06,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:06,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:22:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:22:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:22:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:22:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:22:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:22:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:22:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:22:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:22:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:22:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:22:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:22:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:22:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:22:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:22:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 04:22:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:22:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 04:22:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 04:22:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:22:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 04:22:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 04:22:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 04:22:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 04:22:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 04:22:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 04:22:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 04:22:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 04:22:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 04:22:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 04:22:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 04:22:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 04:22:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 04:22:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 04:22:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-12 04:22:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 04:22:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 04:22:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-12 04:22:06,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:06,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590500562] [2024-11-12 04:22:06,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590500562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:06,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:06,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:22:06,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147430799] [2024-11-12 04:22:06,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:06,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:22:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:06,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:22:06,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:06,811 INFO L87 Difference]: Start difference. First operand 312 states and 452 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:22:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:06,940 INFO L93 Difference]: Finished difference Result 562 states and 801 transitions. [2024-11-12 04:22:06,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:22:06,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 257 [2024-11-12 04:22:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:06,944 INFO L225 Difference]: With dead ends: 562 [2024-11-12 04:22:06,944 INFO L226 Difference]: Without dead ends: 339 [2024-11-12 04:22:06,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:06,946 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 46 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:06,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 317 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:22:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-12 04:22:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 297. [2024-11-12 04:22:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 205 states have (on average 1.273170731707317) internal successors, (261), 206 states have internal predecessors, (261), 84 states have call successors, (84), 7 states have call predecessors, (84), 7 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-12 04:22:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 429 transitions. [2024-11-12 04:22:06,990 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 429 transitions. Word has length 257 [2024-11-12 04:22:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:06,991 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 429 transitions. [2024-11-12 04:22:06,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:22:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 429 transitions. [2024-11-12 04:22:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-12 04:22:06,993 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:06,993 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:06,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 04:22:06,993 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:06,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:06,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1357586360, now seen corresponding path program 1 times [2024-11-12 04:22:06,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:06,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094559787] [2024-11-12 04:22:06,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:06,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:22:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:22:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:22:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:22:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:22:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:22:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:22:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:22:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:22:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:22:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:22:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:22:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:22:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:22:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:22:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:22:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:22:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:22:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 04:22:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:22:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 04:22:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 04:22:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 04:22:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 04:22:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 04:22:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 04:22:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 04:22:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 04:22:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 04:22:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 04:22:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 04:22:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 04:22:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 04:22:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 04:22:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 04:22:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-12 04:22:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 04:22:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-12 04:22:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 04:22:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 04:22:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 192 proven. 36 refuted. 0 times theorem prover too weak. 2892 trivial. 0 not checked. [2024-11-12 04:22:07,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:22:07,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094559787] [2024-11-12 04:22:07,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094559787] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:22:07,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712184344] [2024-11-12 04:22:07,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:07,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:22:07,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:22:07,655 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-11-12 04:22:07,656 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-11-12 04:22:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:07,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 04:22:07,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:22:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1147 proven. 36 refuted. 0 times theorem prover too weak. 1937 trivial. 0 not checked. [2024-11-12 04:22:08,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:22:13,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (mod c_~var_1_34~0 256))) (let ((.cse0 (< 0 c_~var_1_13~0)) (.cse1 (+ (- 128) .cse5)) (.cse4 (< .cse5 128))) (and (or .cse0 (forall ((~var_1_36~0 Int)) (or (< ~var_1_36~0 c_~var_1_13~0) (not (= (mod .cse1 ~var_1_36~0) 0)) (= ~var_1_36~0 0)))) (forall ((~var_1_36~0 Int)) (let ((.cse2 (mod .cse1 ~var_1_36~0))) (or (< (+ .cse2 ~var_1_36~0) c_~var_1_13~0) (= ~var_1_36~0 0) (< .cse2 (+ c_~var_1_13~0 ~var_1_36~0))))) (or .cse0 (forall ((~var_1_36~0 Int)) (or (not (= (mod .cse1 ~var_1_36~0) 0)) (= ~var_1_36~0 0)))) (or (forall ((~var_1_36~0 Int)) (let ((.cse3 (mod .cse1 ~var_1_36~0))) (or (< (+ .cse3 ~var_1_36~0) c_~var_1_13~0) (< .cse3 c_~var_1_13~0) (= ~var_1_36~0 0)))) .cse4) (or (forall ((~var_1_36~0 Int)) (or (< (mod .cse1 ~var_1_36~0) c_~var_1_13~0) (= ~var_1_36~0 0))) .cse4)))) is different from false [2024-11-12 04:22:13,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712184344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:22:13,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:22:13,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2024-11-12 04:22:13,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283573294] [2024-11-12 04:22:13,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:22:13,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 04:22:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:22:13,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 04:22:13,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=96, Unknown=1, NotChecked=20, Total=156 [2024-11-12 04:22:13,562 INFO L87 Difference]: Start difference. First operand 297 states and 429 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (80), 4 states have call predecessors, (80), 7 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) [2024-11-12 04:22:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:14,770 INFO L93 Difference]: Finished difference Result 741 states and 1046 transitions. [2024-11-12 04:22:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 04:22:14,771 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (80), 4 states have call predecessors, (80), 7 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) Word has length 258 [2024-11-12 04:22:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:14,776 INFO L225 Difference]: With dead ends: 741 [2024-11-12 04:22:14,776 INFO L226 Difference]: Without dead ends: 531 [2024-11-12 04:22:14,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=85, Invalid=190, Unknown=1, NotChecked=30, Total=306 [2024-11-12 04:22:14,778 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 184 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:14,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 821 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 04:22:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-12 04:22:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 519. [2024-11-12 04:22:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 375 states have (on average 1.2746666666666666) internal successors, (478), 377 states have internal predecessors, (478), 128 states have call successors, (128), 15 states have call predecessors, (128), 15 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-12 04:22:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 734 transitions. [2024-11-12 04:22:14,852 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 734 transitions. Word has length 258 [2024-11-12 04:22:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:14,852 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 734 transitions. [2024-11-12 04:22:14,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (80), 4 states have call predecessors, (80), 7 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) [2024-11-12 04:22:14,853 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 734 transitions. [2024-11-12 04:22:14,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-12 04:22:14,854 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:14,855 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:14,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 04:22:15,058 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,SelfDestructingSolverStorable13 [2024-11-12 04:22:15,059 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:15,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:15,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1217037750, now seen corresponding path program 1 times [2024-11-12 04:22:15,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:22:15,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377850541] [2024-11-12 04:22:15,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:15,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:22:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:22:15,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241934844] [2024-11-12 04:22:15,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:15,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:22:15,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:22:15,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:22:15,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 04:22:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:22:15,426 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:22:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:22:15,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:22:15,675 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:22:15,675 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:22:15,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 04:22:15,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 04:22:15,881 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:16,051 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:22:16,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:22:16 BoogieIcfgContainer [2024-11-12 04:22:16,055 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:22:16,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:22:16,056 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:22:16,056 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:22:16,056 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:21:19" (3/4) ... [2024-11-12 04:22:16,059 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:22:16,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:22:16,060 INFO L158 Benchmark]: Toolchain (without parser) took 57780.36ms. Allocated memory was 190.8MB in the beginning and 545.3MB in the end (delta: 354.4MB). Free memory was 155.8MB in the beginning and 440.1MB in the end (delta: -284.2MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2024-11-12 04:22:16,060 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 190.8MB. Free memory is still 159.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:22:16,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.79ms. Allocated memory is still 190.8MB. Free memory was 155.8MB in the beginning and 137.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 04:22:16,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.93ms. Allocated memory is still 190.8MB. Free memory was 137.7MB in the beginning and 132.8MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 04:22:16,061 INFO L158 Benchmark]: Boogie Preprocessor took 106.48ms. Allocated memory is still 190.8MB. Free memory was 132.8MB in the beginning and 125.8MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 04:22:16,061 INFO L158 Benchmark]: RCFGBuilder took 751.48ms. Allocated memory is still 190.8MB. Free memory was 125.8MB in the beginning and 91.6MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-12 04:22:16,062 INFO L158 Benchmark]: TraceAbstraction took 56457.47ms. Allocated memory was 190.8MB in the beginning and 545.3MB in the end (delta: 354.4MB). Free memory was 90.8MB in the beginning and 440.1MB in the end (delta: -349.2MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-12 04:22:16,062 INFO L158 Benchmark]: Witness Printer took 4.56ms. Allocated memory is still 545.3MB. Free memory is still 440.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:22:16,063 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 190.8MB. Free memory is still 159.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.79ms. Allocated memory is still 190.8MB. Free memory was 155.8MB in the beginning and 137.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.93ms. Allocated memory is still 190.8MB. Free memory was 137.7MB in the beginning and 132.8MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.48ms. Allocated memory is still 190.8MB. Free memory was 132.8MB in the beginning and 125.8MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 751.48ms. Allocated memory is still 190.8MB. Free memory was 125.8MB in the beginning and 91.6MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 56457.47ms. Allocated memory was 190.8MB in the beginning and 545.3MB in the end (delta: 354.4MB). Free memory was 90.8MB in the beginning and 440.1MB in the end (delta: -349.2MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Witness Printer took 4.56ms. Allocated memory is still 545.3MB. Free memory is still 440.1MB. 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 someBinaryDOUBLEComparisonOperation at line 205, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someUnaryFLOAToperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] signed long int var_1_22 = 0; [L42] signed long int var_1_24 = 2; [L43] unsigned char var_1_27 = 0; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 0; [L46] unsigned char var_1_31 = 0; [L47] unsigned char var_1_32 = 1; [L48] unsigned char var_1_33 = 0; [L49] unsigned char var_1_34 = 16; [L50] signed short int var_1_35 = 8; [L51] signed long int var_1_36 = -10; [L52] signed short int var_1_37 = -4; [L53] float var_1_38 = 15.875; [L54] double var_1_39 = 0.125; [L55] double var_1_40 = 3.8; [L56] float var_1_42 = 1.75; [L57] signed char var_1_43 = -8; [L58] signed char var_1_45 = 25; [L59] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-16, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L209] isInitial = 1 [L210] FCALL initially() [L211] COND TRUE 1 [L212] CALL updateLastVariables() [L202] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-16, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L212] RET updateLastVariables() [L213] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L142] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L142] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L143] var_1_4 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L145] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L145] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L146] var_1_5 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L147] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L148] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L148] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L149] var_1_7 = __VERIFIER_nondet_long() [L150] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L150] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L151] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L151] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L152] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L152] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L153] var_1_8 = __VERIFIER_nondet_long() [L154] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L154] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L155] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L155] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L156] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L156] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L157] var_1_10 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L158] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L159] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L159] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L160] var_1_11 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L161] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L162] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L162] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L163] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L163] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L164] var_1_16 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L165] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L166] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L166] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L167] var_1_17 = __VERIFIER_nondet_ushort() [L168] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L168] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L169] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L169] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L170] var_1_21 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L171] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L172] var_1_29 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L173] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L174] CALL assume_abort_if_not(var_1_29 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L174] RET assume_abort_if_not(var_1_29 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L175] var_1_30 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L176] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L177] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L177] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L178] var_1_31 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L179] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L180] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L180] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L181] var_1_32 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L182] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L183] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L183] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L184] var_1_34 = __VERIFIER_nondet_uchar() [L185] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L185] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L186] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L186] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L187] var_1_36 = __VERIFIER_nondet_long() [L188] CALL assume_abort_if_not(var_1_36 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L188] RET assume_abort_if_not(var_1_36 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L189] CALL assume_abort_if_not(var_1_36 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L189] RET assume_abort_if_not(var_1_36 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L190] CALL assume_abort_if_not(var_1_36 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L190] RET assume_abort_if_not(var_1_36 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L191] var_1_39 = __VERIFIER_nondet_double() [L192] CALL assume_abort_if_not((var_1_39 >= 0.0F && 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_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L192] RET assume_abort_if_not((var_1_39 >= 0.0F && 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_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L193] var_1_40 = __VERIFIER_nondet_double() [L194] 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_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L194] 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_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L195] var_1_42 = __VERIFIER_nondet_float() [L196] CALL assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L196] RET assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L197] var_1_45 = __VERIFIER_nondet_char() [L198] CALL assume_abort_if_not(var_1_45 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L198] RET assume_abort_if_not(var_1_45 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L199] CALL assume_abort_if_not(var_1_45 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L199] RET assume_abort_if_not(var_1_45 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L213] RET updateVariables() [L214] CALL step() [L63] var_1_22 = var_1_13 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L64] COND FALSE !(var_1_19 && var_1_19) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L69] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L80] COND TRUE var_1_6 != ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) [L81] var_1_33 = (5 + var_1_34) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L83] COND TRUE (~ var_1_34) > (var_1_1 / var_1_36) [L84] var_1_35 = (((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) < 0 ) ? -((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) : ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L86] var_1_37 = ((((((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) < (var_1_15)) ? (((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) : (var_1_15))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L87] COND FALSE !(var_1_1 == var_1_36) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L92] COND TRUE var_1_40 >= var_1_39 [L93] var_1_38 = ((((var_1_42) < 0 ) ? -(var_1_42) : (var_1_42))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L96] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L97] COND FALSE !(((var_1_34 + -128) % var_1_36) >= var_1_13) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L103] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L103] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L108] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L110] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L110] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L111] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L112] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L116] signed long int stepLocal_1 = -4; [L117] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L118] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L123] var_1_18 = var_1_17 [L124] var_1_19 = 0 [L125] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L126] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L129] COND TRUE var_1_3 <= var_1_1 [L130] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=16, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L134] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=65534, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=16, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L135] COND TRUE (~ var_1_3) < stepLocal_2 [L136] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L214] RET step() [L215] CALL, EXPR property() [L205] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L205] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L205] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L205] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L205] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L205] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L205-L206] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L215] RET, EXPR property() [L215] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.2s, OverallIterations: 15, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2392 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2362 mSDsluCounter, 9056 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6711 mSDsCounter, 461 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4580 IncrementalHoareTripleChecker+Invalid, 5041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 461 mSolverCounterUnsat, 2345 mSDtfsCounter, 4580 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1637 GetRequests, 1514 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 17.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=519occurred in iteration=14, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 847 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 36.6s InterpolantComputationTime, 4351 NumberOfCodeBlocks, 4351 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3820 ConstructedInterpolants, 0 QuantifiedInterpolants, 22309 SizeOfPredicates, 3 NumberOfNonLiveVariables, 575 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 46728/46800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 04:22:16,279 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-12 04:22:16,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-84.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 923c55cd47017cc93a25a3016e3f55fbf64dcf09203b0c245c78e75ea53bbbc0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:22:18,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:22:18,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:22:18,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:22:18,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:22:18,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:22:18,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:22:18,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:22:18,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:22:18,451 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:22:18,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:22:18,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:22:18,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:22:18,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:22:18,454 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:22:18,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:22:18,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:22:18,455 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:22:18,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:22:18,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:22:18,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:22:18,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:22:18,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:22:18,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:22:18,458 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:22:18,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:22:18,459 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:22:18,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:22:18,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:22:18,460 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:22:18,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:22:18,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:22:18,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:22:18,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:22:18,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:22:18,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:22:18,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:22:18,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:22:18,463 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:22:18,463 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:22:18,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:22:18,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:22:18,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:22:18,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:22:18,465 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 -> 923c55cd47017cc93a25a3016e3f55fbf64dcf09203b0c245c78e75ea53bbbc0 [2024-11-12 04:22:18,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:22:18,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:22:18,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:22:18,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:22:18,837 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:22:18,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i [2024-11-12 04:22:20,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:22:20,672 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:22:20,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i [2024-11-12 04:22:20,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e7fe636/3562be3416dd4f299e52f2e3172a37d4/FLAG6a0237c2b [2024-11-12 04:22:20,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e7fe636/3562be3416dd4f299e52f2e3172a37d4 [2024-11-12 04:22:20,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:22:20,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:22:20,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:22:20,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:22:20,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:22:20,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:22:20" (1/1) ... [2024-11-12 04:22:20,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c58fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:20, skipping insertion in model container [2024-11-12 04:22:20,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:22:20" (1/1) ... [2024-11-12 04:22:20,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:22:20,967 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i[919,932] [2024-11-12 04:22:21,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:22:21,094 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:22:21,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i[919,932] [2024-11-12 04:22:21,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:22:21,180 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:22:21,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:21 WrapperNode [2024-11-12 04:22:21,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:22:21,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:22:21,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:22:21,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:22:21,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:21" (1/1) ... [2024-11-12 04:22:21,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:21" (1/1) ... [2024-11-12 04:22:21,246 INFO L138 Inliner]: procedures = 27, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2024-11-12 04:22:21,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:22:21,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:22:21,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:22:21,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:22:21,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:21" (1/1) ... [2024-11-12 04:22:21,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:21" (1/1) ... [2024-11-12 04:22:21,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:21" (1/1) ... [2024-11-12 04:22:21,293 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:22:21,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:21" (1/1) ... [2024-11-12 04:22:21,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:21" (1/1) ... [2024-11-12 04:22:21,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:21" (1/1) ... [2024-11-12 04:22:21,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:21" (1/1) ... [2024-11-12 04:22:21,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:21" (1/1) ... [2024-11-12 04:22:21,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:21" (1/1) ... [2024-11-12 04:22:21,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:22:21,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:22:21,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:22:21,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:22:21,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:21" (1/1) ... [2024-11-12 04:22:21,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:22:21,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:22:21,395 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:22:21,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:22:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:22:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:22:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:22:21,450 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:22:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:22:21,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:22:21,562 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:22:21,566 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:22:22,749 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 04:22:22,749 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:22:22,767 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:22:22,767 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:22:22,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:22:22 BoogieIcfgContainer [2024-11-12 04:22:22,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:22:22,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:22:22,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:22:22,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:22:22,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:22:20" (1/3) ... [2024-11-12 04:22:22,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b41001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:22:22, skipping insertion in model container [2024-11-12 04:22:22,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:22:21" (2/3) ... [2024-11-12 04:22:22,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b41001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:22:22, skipping insertion in model container [2024-11-12 04:22:22,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:22:22" (3/3) ... [2024-11-12 04:22:22,779 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i [2024-11-12 04:22:22,796 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:22:22,796 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:22:22,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:22:22,876 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;@1814e5ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:22:22,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:22:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 04:22:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-12 04:22:22,913 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:22,914 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:22,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:22,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:22,921 INFO L85 PathProgramCache]: Analyzing trace with hash 202276579, now seen corresponding path program 1 times [2024-11-12 04:22:22,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:22:22,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098088251] [2024-11-12 04:22:22,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:22,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:22,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:22:22,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:22:22,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 04:22:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:23,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:22:23,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:22:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 974 proven. 0 refuted. 0 times theorem prover too weak. 2146 trivial. 0 not checked. [2024-11-12 04:22:23,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:22:23,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:22:23,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098088251] [2024-11-12 04:22:23,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098088251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:23,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:23,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:22:23,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684304131] [2024-11-12 04:22:23,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:23,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:22:23,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:22:23,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:22:23,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:22:23,445 INFO L87 Difference]: Start difference. First operand has 104 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-12 04:22:23,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:23,493 INFO L93 Difference]: Finished difference Result 201 states and 366 transitions. [2024-11-12 04:22:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:22:23,496 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 247 [2024-11-12 04:22:23,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:23,506 INFO L225 Difference]: With dead ends: 201 [2024-11-12 04:22:23,508 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 04:22:23,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:22:23,519 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:23,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:22:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 04:22:23,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-12 04:22:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 04:22:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 159 transitions. [2024-11-12 04:22:23,589 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 159 transitions. Word has length 247 [2024-11-12 04:22:23,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:23,590 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 159 transitions. [2024-11-12 04:22:23,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-12 04:22:23,590 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 159 transitions. [2024-11-12 04:22:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-12 04:22:23,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:23,599 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:23,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 04:22:23,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:23,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:23,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:23,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1439936235, now seen corresponding path program 1 times [2024-11-12 04:22:23,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:22:23,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173185129] [2024-11-12 04:22:23,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:23,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:23,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:22:23,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:22:23,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 04:22:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:24,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 04:22:24,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:22:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-12 04:22:24,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:22:24,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:22:24,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173185129] [2024-11-12 04:22:24,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173185129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:22:24,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:22:24,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:22:24,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067104498] [2024-11-12 04:22:24,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:22:24,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:22:24,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:22:24,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:22:24,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:24,164 INFO L87 Difference]: Start difference. First operand 100 states and 159 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:22:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:22:24,249 INFO L93 Difference]: Finished difference Result 194 states and 309 transitions. [2024-11-12 04:22:24,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:22:24,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 247 [2024-11-12 04:22:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:22:24,260 INFO L225 Difference]: With dead ends: 194 [2024-11-12 04:22:24,260 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 04:22:24,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:22:24,263 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:22:24,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 144 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:22:24,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 04:22:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-12 04:22:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 55 states have internal predecessors, (69), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 04:22:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 149 transitions. [2024-11-12 04:22:24,292 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 149 transitions. Word has length 247 [2024-11-12 04:22:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:22:24,294 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 149 transitions. [2024-11-12 04:22:24,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-12 04:22:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 149 transitions. [2024-11-12 04:22:24,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-12 04:22:24,298 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:22:24,298 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:22:24,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 04:22:24,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:24,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:22:24,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:22:24,501 INFO L85 PathProgramCache]: Analyzing trace with hash 785161106, now seen corresponding path program 1 times [2024-11-12 04:22:24,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:22:24,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395919114] [2024-11-12 04:22:24,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:22:24,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:22:24,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:22:24,504 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:22:24,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 04:22:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:22:25,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 04:22:25,206 INFO L279 TraceCheckSpWp]: Computing forward predicates...