./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-47.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 72a058d8f1934b68fcbca0a1da7b19bbf59cfe4d4b87abeecd729ed9998e917c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:10:10,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:10:10,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:10:10,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:10:10,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:10:10,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:10:10,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:10:10,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:10:10,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:10:10,198 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:10:10,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:10:10,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:10:10,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:10:10,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:10:10,200 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:10:10,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:10:10,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:10:10,201 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:10:10,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:10:10,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:10:10,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:10:10,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:10:10,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:10:10,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:10:10,203 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:10:10,203 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:10:10,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:10:10,204 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:10:10,206 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:10:10,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:10:10,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:10:10,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:10:10,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:10:10,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:10:10,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:10:10,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:10:10,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:10:10,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:10:10,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:10:10,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:10:10,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:10:10,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:10:10,217 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 -> 72a058d8f1934b68fcbca0a1da7b19bbf59cfe4d4b87abeecd729ed9998e917c [2024-11-08 21:10:10,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:10:10,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:10:10,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:10:10,455 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:10:10,456 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:10:10,457 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-pe-ci_file-47.i [2024-11-08 21:10:11,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:10:12,000 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:10:12,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-47.i [2024-11-08 21:10:12,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7180c34a/9791aa2a7b7347e7b0a8a248a9160ef9/FLAG540ea8c94 [2024-11-08 21:10:12,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7180c34a/9791aa2a7b7347e7b0a8a248a9160ef9 [2024-11-08 21:10:12,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:10:12,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:10:12,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:10:12,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:10:12,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:10:12,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:10:12" (1/1) ... [2024-11-08 21:10:12,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a27ffbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12, skipping insertion in model container [2024-11-08 21:10:12,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:10:12" (1/1) ... [2024-11-08 21:10:12,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:10:12,586 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-pe-ci_file-47.i[919,932] [2024-11-08 21:10:12,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:10:12,653 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:10:12,663 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-pe-ci_file-47.i[919,932] [2024-11-08 21:10:12,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:10:12,724 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:10:12,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12 WrapperNode [2024-11-08 21:10:12,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:10:12,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:10:12,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:10:12,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:10:12,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12" (1/1) ... [2024-11-08 21:10:12,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12" (1/1) ... [2024-11-08 21:10:12,788 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 290 [2024-11-08 21:10:12,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:10:12,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:10:12,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:10:12,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:10:12,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12" (1/1) ... [2024-11-08 21:10:12,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12" (1/1) ... [2024-11-08 21:10:12,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12" (1/1) ... [2024-11-08 21:10:12,830 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:10:12,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12" (1/1) ... [2024-11-08 21:10:12,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12" (1/1) ... [2024-11-08 21:10:12,851 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12" (1/1) ... [2024-11-08 21:10:12,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12" (1/1) ... [2024-11-08 21:10:12,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12" (1/1) ... [2024-11-08 21:10:12,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12" (1/1) ... [2024-11-08 21:10:12,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:10:12,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:10:12,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:10:12,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:10:12,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12" (1/1) ... [2024-11-08 21:10:12,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:10:12,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:10:12,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:10:12,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:10:12,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:10:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:10:12,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:10:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:10:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:10:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:10:13,043 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:10:13,047 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:10:13,562 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 21:10:13,563 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:10:13,586 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:10:13,587 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:10:13,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:10:13 BoogieIcfgContainer [2024-11-08 21:10:13,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:10:13,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:10:13,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:10:13,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:10:13,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:10:12" (1/3) ... [2024-11-08 21:10:13,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3767bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:10:13, skipping insertion in model container [2024-11-08 21:10:13,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:12" (2/3) ... [2024-11-08 21:10:13,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3767bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:10:13, skipping insertion in model container [2024-11-08 21:10:13,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:10:13" (3/3) ... [2024-11-08 21:10:13,595 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-47.i [2024-11-08 21:10:13,609 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:10:13,610 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:10:13,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:10:13,682 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;@a783660, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:10:13,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:10:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 91 states have internal predecessors, (138), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:10:13,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 21:10:13,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:10:13,703 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:13,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:10:13,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:10:13,709 INFO L85 PathProgramCache]: Analyzing trace with hash -528290330, now seen corresponding path program 1 times [2024-11-08 21:10:13,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:10:13,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061503801] [2024-11-08 21:10:13,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:13,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:10:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:13,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:10:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:10:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:10:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:10:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:10:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:10:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:10:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:10:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:10:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:10:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:10:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:10:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:10:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:10:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:10:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:10:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:10:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:10:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:10:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:10:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:10:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:10:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:10:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:10:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:10:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:10:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:10:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:10:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:10:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:10:14,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:10:14,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061503801] [2024-11-08 21:10:14,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061503801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:10:14,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:10:14,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:10:14,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745939182] [2024-11-08 21:10:14,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:10:14,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:10:14,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:10:14,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:10:14,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:10:14,223 INFO L87 Difference]: Start difference. First operand has 122 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 91 states have internal predecessors, (138), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:10:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:10:14,250 INFO L93 Difference]: Finished difference Result 237 states and 415 transitions. [2024-11-08 21:10:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:10:14,255 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 193 [2024-11-08 21:10:14,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:10:14,262 INFO L225 Difference]: With dead ends: 237 [2024-11-08 21:10:14,262 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 21:10:14,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:10:14,269 INFO L432 NwaCegarLoop]: 185 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, 185 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:10:14,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:10:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 21:10:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-08 21:10:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 87 states have (on average 1.4597701149425288) internal successors, (127), 87 states have internal predecessors, (127), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:10:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 185 transitions. [2024-11-08 21:10:14,329 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 185 transitions. Word has length 193 [2024-11-08 21:10:14,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:10:14,330 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 185 transitions. [2024-11-08 21:10:14,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:10:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 185 transitions. [2024-11-08 21:10:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 21:10:14,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:10:14,336 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:14,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:10:14,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:10:14,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:10:14,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1479006878, now seen corresponding path program 1 times [2024-11-08 21:10:14,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:10:14,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797264402] [2024-11-08 21:10:14,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:14,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:10:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:10:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:10:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:10:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:10:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:10:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:10:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:10:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:10:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:10:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:10:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:10:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:10:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:10:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:10:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:10:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:10:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:10:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:10:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:10:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:10:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:10:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:10:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:10:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:10:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:10:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:10:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:10:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:10:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:10:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:10:14,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:10:14,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797264402] [2024-11-08 21:10:14,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797264402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:10:14,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:10:14,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:10:14,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391571279] [2024-11-08 21:10:14,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:10:14,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:10:14,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:10:14,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:10:14,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:10:14,887 INFO L87 Difference]: Start difference. First operand 118 states and 185 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:10:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:10:15,285 INFO L93 Difference]: Finished difference Result 388 states and 607 transitions. [2024-11-08 21:10:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:10:15,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2024-11-08 21:10:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:10:15,288 INFO L225 Difference]: With dead ends: 388 [2024-11-08 21:10:15,289 INFO L226 Difference]: Without dead ends: 273 [2024-11-08 21:10:15,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:10:15,294 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 278 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:10:15,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 516 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:10:15,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-08 21:10:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 268. [2024-11-08 21:10:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 202 states have (on average 1.4603960396039604) internal successors, (295), 203 states have internal predecessors, (295), 62 states have call successors, (62), 3 states have call predecessors, (62), 3 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 21:10:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 419 transitions. [2024-11-08 21:10:15,335 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 419 transitions. Word has length 194 [2024-11-08 21:10:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:10:15,335 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 419 transitions. [2024-11-08 21:10:15,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:10:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 419 transitions. [2024-11-08 21:10:15,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 21:10:15,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:10:15,341 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:15,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:10:15,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:10:15,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:10:15,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2135902048, now seen corresponding path program 1 times [2024-11-08 21:10:15,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:10:15,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843727794] [2024-11-08 21:10:15,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:15,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:10:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:10:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:10:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:10:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:10:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:10:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:10:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:10:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:10:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:10:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:10:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:10:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:10:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:10:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:10:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:10:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:10:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:10:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:10:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:10:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:10:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:10:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:10:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:10:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:10:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:10:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:10:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:10:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:10:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:10:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:10:15,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:10:15,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843727794] [2024-11-08 21:10:15,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843727794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:10:15,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:10:15,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:10:15,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813987526] [2024-11-08 21:10:15,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:10:15,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:10:15,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:10:15,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:10:15,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:10:15,843 INFO L87 Difference]: Start difference. First operand 268 states and 419 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:10:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:10:16,180 INFO L93 Difference]: Finished difference Result 1136 states and 1779 transitions. [2024-11-08 21:10:16,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:10:16,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2024-11-08 21:10:16,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:10:16,187 INFO L225 Difference]: With dead ends: 1136 [2024-11-08 21:10:16,188 INFO L226 Difference]: Without dead ends: 871 [2024-11-08 21:10:16,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:10:16,190 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 455 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:10:16,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 806 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:10:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-08 21:10:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 607. [2024-11-08 21:10:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 445 states have (on average 1.4314606741573033) internal successors, (637), 448 states have internal predecessors, (637), 153 states have call successors, (153), 8 states have call predecessors, (153), 8 states have return successors, (153), 150 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-08 21:10:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 943 transitions. [2024-11-08 21:10:16,272 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 943 transitions. Word has length 194 [2024-11-08 21:10:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:10:16,273 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 943 transitions. [2024-11-08 21:10:16,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:10:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 943 transitions. [2024-11-08 21:10:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 21:10:16,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:10:16,280 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:16,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:10:16,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:10:16,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:10:16,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1649592158, now seen corresponding path program 1 times [2024-11-08 21:10:16,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:10:16,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601269312] [2024-11-08 21:10:16,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:16,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:10:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:10:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:10:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:10:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:10:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:10:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:10:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:10:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:10:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:10:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:10:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:10:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:10:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:10:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:10:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:10:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:10:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:10:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:10:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:10:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:10:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:10:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:10:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:10:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:10:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:10:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:10:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:10:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:10:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:10:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:10:16,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:10:16,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601269312] [2024-11-08 21:10:16,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601269312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:10:16,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:10:16,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:10:16,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119315143] [2024-11-08 21:10:16,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:10:16,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:10:16,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:10:16,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:10:16,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:10:16,872 INFO L87 Difference]: Start difference. First operand 607 states and 943 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:10:17,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:10:17,140 INFO L93 Difference]: Finished difference Result 1024 states and 1591 transitions. [2024-11-08 21:10:17,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:10:17,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2024-11-08 21:10:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:10:17,146 INFO L225 Difference]: With dead ends: 1024 [2024-11-08 21:10:17,147 INFO L226 Difference]: Without dead ends: 474 [2024-11-08 21:10:17,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:10:17,149 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 130 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:10:17,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 513 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:10:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-08 21:10:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 345. [2024-11-08 21:10:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 248 states have (on average 1.403225806451613) internal successors, (348), 249 states have internal predecessors, (348), 91 states have call successors, (91), 5 states have call predecessors, (91), 5 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-08 21:10:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 530 transitions. [2024-11-08 21:10:17,206 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 530 transitions. Word has length 194 [2024-11-08 21:10:17,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:10:17,208 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 530 transitions. [2024-11-08 21:10:17,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:10:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 530 transitions. [2024-11-08 21:10:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 21:10:17,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:10:17,211 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:17,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:10:17,211 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:10:17,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:10:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1682029211, now seen corresponding path program 1 times [2024-11-08 21:10:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:10:17,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247798519] [2024-11-08 21:10:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:10:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:10:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:10:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:10:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:10:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:10:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:10:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:10:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:10:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:10:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:10:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:10:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:10:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:10:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:10:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:10:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:10:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:10:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:10:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:10:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:10:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:10:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:10:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:10:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:10:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:10:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:10:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:10:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:10:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:10:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:10:17,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:10:17,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247798519] [2024-11-08 21:10:17,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247798519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:10:17,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:10:17,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:10:17,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413936721] [2024-11-08 21:10:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:10:17,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:10:17,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:10:17,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:10:17,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:10:17,637 INFO L87 Difference]: Start difference. First operand 345 states and 530 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:10:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:10:18,197 INFO L93 Difference]: Finished difference Result 934 states and 1444 transitions. [2024-11-08 21:10:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:10:18,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 196 [2024-11-08 21:10:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:10:18,202 INFO L225 Difference]: With dead ends: 934 [2024-11-08 21:10:18,202 INFO L226 Difference]: Without dead ends: 669 [2024-11-08 21:10:18,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:10:18,204 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 248 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:10:18,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 756 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 21:10:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-08 21:10:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 582. [2024-11-08 21:10:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 450 states have (on average 1.4333333333333333) internal successors, (645), 452 states have internal predecessors, (645), 124 states have call successors, (124), 7 states have call predecessors, (124), 7 states have return successors, (124), 122 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-08 21:10:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 893 transitions. [2024-11-08 21:10:18,270 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 893 transitions. Word has length 196 [2024-11-08 21:10:18,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:10:18,270 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 893 transitions. [2024-11-08 21:10:18,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:10:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 893 transitions. [2024-11-08 21:10:18,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 21:10:18,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:10:18,272 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:18,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:10:18,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:10:18,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:10:18,273 INFO L85 PathProgramCache]: Analyzing trace with hash 804485117, now seen corresponding path program 1 times [2024-11-08 21:10:18,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:10:18,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156197790] [2024-11-08 21:10:18,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:18,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:10:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:10:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:10:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:10:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:10:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:10:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:10:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:10:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:10:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:10:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:10:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:10:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:10:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:10:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:10:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:10:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:10:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:10:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:10:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:10:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:10:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:10:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:10:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:10:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:10:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:10:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:10:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:10:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:10:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:10:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:10:18,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:10:18,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156197790] [2024-11-08 21:10:18,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156197790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:10:18,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:10:18,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 21:10:18,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395790346] [2024-11-08 21:10:18,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:10:18,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 21:10:18,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:10:18,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 21:10:18,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:10:18,850 INFO L87 Difference]: Start difference. First operand 582 states and 893 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:10:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:10:20,678 INFO L93 Difference]: Finished difference Result 1232 states and 1882 transitions. [2024-11-08 21:10:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 21:10:20,679 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 197 [2024-11-08 21:10:20,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:10:20,683 INFO L225 Difference]: With dead ends: 1232 [2024-11-08 21:10:20,684 INFO L226 Difference]: Without dead ends: 967 [2024-11-08 21:10:20,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-08 21:10:20,685 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 999 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:10:20,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 1143 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 21:10:20,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2024-11-08 21:10:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 890. [2024-11-08 21:10:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 715 states have (on average 1.4489510489510489) internal successors, (1036), 722 states have internal predecessors, (1036), 160 states have call successors, (160), 14 states have call predecessors, (160), 14 states have return successors, (160), 153 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-08 21:10:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1356 transitions. [2024-11-08 21:10:20,753 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1356 transitions. Word has length 197 [2024-11-08 21:10:20,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:10:20,754 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1356 transitions. [2024-11-08 21:10:20,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:10:20,754 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1356 transitions. [2024-11-08 21:10:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 21:10:20,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:10:20,756 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:20,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:10:20,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:10:20,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:10:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1294048698, now seen corresponding path program 1 times [2024-11-08 21:10:20,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:10:20,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698685200] [2024-11-08 21:10:20,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:20,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:10:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:10:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:10:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:10:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:10:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:10:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:10:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:10:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:10:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:10:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:10:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:10:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:10:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:10:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:10:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:10:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:10:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:10:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:10:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:10:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:10:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:10:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:10:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:10:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:10:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:10:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:10:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:10:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:10:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:10:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 63 proven. 99 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2024-11-08 21:10:21,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:10:21,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698685200] [2024-11-08 21:10:21,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698685200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:10:21,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433268400] [2024-11-08 21:10:21,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:21,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:10:21,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:10:21,518 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-08 21:10:21,519 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-08 21:10:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:21,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 21:10:21,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:10:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 864 proven. 246 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2024-11-08 21:10:23,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:10:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 114 proven. 129 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2024-11-08 21:10:24,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433268400] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:10:24,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:10:24,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 32 [2024-11-08 21:10:24,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147878500] [2024-11-08 21:10:24,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:10:24,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 21:10:24,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:10:24,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 21:10:24,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2024-11-08 21:10:24,112 INFO L87 Difference]: Start difference. First operand 890 states and 1356 transitions. Second operand has 32 states, 30 states have (on average 5.066666666666666) internal successors, (152), 28 states have internal predecessors, (152), 12 states have call successors, (87), 6 states have call predecessors, (87), 12 states have return successors, (87), 12 states have call predecessors, (87), 12 states have call successors, (87) [2024-11-08 21:10:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:10:29,786 INFO L93 Difference]: Finished difference Result 3193 states and 4638 transitions. [2024-11-08 21:10:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-11-08 21:10:29,787 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 5.066666666666666) internal successors, (152), 28 states have internal predecessors, (152), 12 states have call successors, (87), 6 states have call predecessors, (87), 12 states have return successors, (87), 12 states have call predecessors, (87), 12 states have call successors, (87) Word has length 197 [2024-11-08 21:10:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:10:29,802 INFO L225 Difference]: With dead ends: 3193 [2024-11-08 21:10:29,804 INFO L226 Difference]: Without dead ends: 2394 [2024-11-08 21:10:29,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4405 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2761, Invalid=10349, Unknown=0, NotChecked=0, Total=13110 [2024-11-08 21:10:29,809 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1458 mSDsluCounter, 2843 mSDsCounter, 0 mSdLazyCounter, 4358 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 3156 SdHoareTripleChecker+Invalid, 4828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 4358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:10:29,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 3156 Invalid, 4828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 4358 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 21:10:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2024-11-08 21:10:29,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 1340. [2024-11-08 21:10:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1112 states have (on average 1.4181654676258992) internal successors, (1577), 1123 states have internal predecessors, (1577), 186 states have call successors, (186), 41 states have call predecessors, (186), 41 states have return successors, (186), 175 states have call predecessors, (186), 186 states have call successors, (186) [2024-11-08 21:10:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1949 transitions. [2024-11-08 21:10:29,913 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1949 transitions. Word has length 197 [2024-11-08 21:10:29,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:10:29,914 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 1949 transitions. [2024-11-08 21:10:29,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 5.066666666666666) internal successors, (152), 28 states have internal predecessors, (152), 12 states have call successors, (87), 6 states have call predecessors, (87), 12 states have return successors, (87), 12 states have call predecessors, (87), 12 states have call successors, (87) [2024-11-08 21:10:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1949 transitions. [2024-11-08 21:10:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 21:10:29,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:10:29,916 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:29,930 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-08 21:10:30,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:10:30,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:10:30,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:10:30,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1504785307, now seen corresponding path program 1 times [2024-11-08 21:10:30,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:10:30,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886016638] [2024-11-08 21:10:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:30,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:10:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:10:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:10:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:10:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:10:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:10:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:10:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:10:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:10:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:10:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:10:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:10:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:10:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:10:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:10:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:10:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:10:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:10:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:10:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:10:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:10:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:10:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:10:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:10:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:10:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:10:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:10:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:10:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:10:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:10:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:30,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:10:30,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:10:30,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886016638] [2024-11-08 21:10:30,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886016638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:10:30,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:10:30,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:10:30,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067817192] [2024-11-08 21:10:30,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:10:30,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:10:30,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:10:30,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:10:30,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:10:30,393 INFO L87 Difference]: Start difference. First operand 1340 states and 1949 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:10:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:10:31,137 INFO L93 Difference]: Finished difference Result 2811 states and 4052 transitions. [2024-11-08 21:10:31,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 21:10:31,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 198 [2024-11-08 21:10:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:10:31,145 INFO L225 Difference]: With dead ends: 2811 [2024-11-08 21:10:31,145 INFO L226 Difference]: Without dead ends: 1808 [2024-11-08 21:10:31,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 21:10:31,149 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 514 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:10:31,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 677 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 21:10:31,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2024-11-08 21:10:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1257. [2024-11-08 21:10:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1068 states have (on average 1.4297752808988764) internal successors, (1527), 1077 states have internal predecessors, (1527), 149 states have call successors, (149), 39 states have call predecessors, (149), 39 states have return successors, (149), 140 states have call predecessors, (149), 149 states have call successors, (149) [2024-11-08 21:10:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1825 transitions. [2024-11-08 21:10:31,248 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1825 transitions. Word has length 198 [2024-11-08 21:10:31,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:10:31,249 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1825 transitions. [2024-11-08 21:10:31,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:10:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1825 transitions. [2024-11-08 21:10:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 21:10:31,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:10:31,252 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:31,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 21:10:31,252 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:10:31,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:10:31,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1930815584, now seen corresponding path program 1 times [2024-11-08 21:10:31,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:10:31,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383677490] [2024-11-08 21:10:31,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:31,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:10:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:10:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:10:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:10:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:10:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:10:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:10:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:10:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:10:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:10:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:10:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:10:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:10:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:10:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:10:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:10:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:10:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:10:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:10:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:10:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:10:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:10:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:10:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:10:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:10:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:10:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:10:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:10:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:10:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:10:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-08 21:10:31,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:10:31,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383677490] [2024-11-08 21:10:31,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383677490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:10:31,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201706277] [2024-11-08 21:10:31,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:31,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:10:31,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:10:31,703 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-08 21:10:31,705 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-08 21:10:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:31,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 21:10:31,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:10:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 268 proven. 150 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2024-11-08 21:10:32,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:10:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-08 21:10:32,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201706277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:10:32,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:10:32,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 19 [2024-11-08 21:10:32,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589172596] [2024-11-08 21:10:32,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:10:32,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 21:10:32,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:10:32,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 21:10:32,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-08 21:10:32,954 INFO L87 Difference]: Start difference. First operand 1257 states and 1825 transitions. Second operand has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (87), 4 states have call predecessors, (87), 7 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) [2024-11-08 21:10:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:10:33,812 INFO L93 Difference]: Finished difference Result 2502 states and 3624 transitions. [2024-11-08 21:10:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 21:10:33,813 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (87), 4 states have call predecessors, (87), 7 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) Word has length 198 [2024-11-08 21:10:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:10:33,818 INFO L225 Difference]: With dead ends: 2502 [2024-11-08 21:10:33,818 INFO L226 Difference]: Without dead ends: 1339 [2024-11-08 21:10:33,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2024-11-08 21:10:33,821 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 446 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 21:10:33,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1207 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 21:10:33,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2024-11-08 21:10:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1139. [2024-11-08 21:10:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 968 states have (on average 1.4245867768595042) internal successors, (1379), 975 states have internal predecessors, (1379), 135 states have call successors, (135), 35 states have call predecessors, (135), 35 states have return successors, (135), 128 states have call predecessors, (135), 135 states have call successors, (135) [2024-11-08 21:10:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1649 transitions. [2024-11-08 21:10:33,928 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1649 transitions. Word has length 198 [2024-11-08 21:10:33,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:10:33,928 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1649 transitions. [2024-11-08 21:10:33,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (87), 4 states have call predecessors, (87), 7 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) [2024-11-08 21:10:33,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1649 transitions. [2024-11-08 21:10:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:10:33,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:10:33,930 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:33,943 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-08 21:10:34,131 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,SelfDestructingSolverStorable8 [2024-11-08 21:10:34,131 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:10:34,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:10:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1336154129, now seen corresponding path program 1 times [2024-11-08 21:10:34,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:10:34,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191789333] [2024-11-08 21:10:34,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:34,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:10:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:10:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:10:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:10:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:10:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:10:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:10:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:10:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:10:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:10:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:10:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:10:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:10:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:10:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:10:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:10:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:10:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:10:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:10:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:10:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:10:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:10:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:10:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:10:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:10:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:10:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:10:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:10:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:10:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:10:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:10:34,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:10:34,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191789333] [2024-11-08 21:10:34,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191789333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:10:34,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:10:34,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 21:10:34,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577287714] [2024-11-08 21:10:34,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:10:34,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 21:10:34,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:10:34,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 21:10:34,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 21:10:34,904 INFO L87 Difference]: Start difference. First operand 1139 states and 1649 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:10:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:10:35,576 INFO L93 Difference]: Finished difference Result 2337 states and 3365 transitions. [2024-11-08 21:10:35,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 21:10:35,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 199 [2024-11-08 21:10:35,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:10:35,582 INFO L225 Difference]: With dead ends: 2337 [2024-11-08 21:10:35,583 INFO L226 Difference]: Without dead ends: 1549 [2024-11-08 21:10:35,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:10:35,585 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 594 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:10:35,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 961 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 21:10:35,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2024-11-08 21:10:35,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1176. [2024-11-08 21:10:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1005 states have (on average 1.4288557213930348) internal successors, (1436), 1011 states have internal predecessors, (1436), 134 states have call successors, (134), 36 states have call predecessors, (134), 36 states have return successors, (134), 128 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-08 21:10:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1704 transitions. [2024-11-08 21:10:35,684 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1704 transitions. Word has length 199 [2024-11-08 21:10:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:10:35,684 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1704 transitions. [2024-11-08 21:10:35,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:10:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1704 transitions. [2024-11-08 21:10:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:10:35,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:10:35,686 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:35,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 21:10:35,686 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:10:35,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:10:35,687 INFO L85 PathProgramCache]: Analyzing trace with hash -656095759, now seen corresponding path program 1 times [2024-11-08 21:10:35,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:10:35,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380155901] [2024-11-08 21:10:35,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:35,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:10:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:10:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:10:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:10:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:10:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:10:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:10:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:10:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:10:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:10:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:10:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:10:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:10:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:10:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:10:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:10:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:10:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:10:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:10:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:10:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:10:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:10:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:10:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:10:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:10:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:10:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:10:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:10:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:10:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:10:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 15 proven. 69 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-08 21:10:36,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:10:36,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380155901] [2024-11-08 21:10:36,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380155901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:10:36,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515216054] [2024-11-08 21:10:36,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:36,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:10:36,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:10:36,219 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:10:36,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 21:10:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:36,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 21:10:36,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:10:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 864 proven. 246 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2024-11-08 21:10:37,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:10:37,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515216054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:10:37,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:10:37,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 20 [2024-11-08 21:10:37,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3737334] [2024-11-08 21:10:37,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:10:37,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 21:10:37,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:10:37,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 21:10:37,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2024-11-08 21:10:37,705 INFO L87 Difference]: Start difference. First operand 1176 states and 1704 transitions. Second operand has 20 states, 20 states have (on average 5.7) internal successors, (114), 18 states have internal predecessors, (114), 6 states have call successors, (55), 5 states have call predecessors, (55), 7 states have return successors, (56), 6 states have call predecessors, (56), 6 states have call successors, (56) [2024-11-08 21:10:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:10:42,194 INFO L93 Difference]: Finished difference Result 3366 states and 4679 transitions. [2024-11-08 21:10:42,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2024-11-08 21:10:42,195 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.7) internal successors, (114), 18 states have internal predecessors, (114), 6 states have call successors, (55), 5 states have call predecessors, (55), 7 states have return successors, (56), 6 states have call predecessors, (56), 6 states have call successors, (56) Word has length 199 [2024-11-08 21:10:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:10:42,203 INFO L225 Difference]: With dead ends: 3366 [2024-11-08 21:10:42,203 INFO L226 Difference]: Without dead ends: 2506 [2024-11-08 21:10:42,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 341 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7700 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3113, Invalid=17479, Unknown=0, NotChecked=0, Total=20592 [2024-11-08 21:10:42,209 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 1039 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 21:10:42,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 1828 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2571 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 21:10:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2024-11-08 21:10:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 870. [2024-11-08 21:10:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 719 states have (on average 1.388038942976356) internal successors, (998), 719 states have internal predecessors, (998), 116 states have call successors, (116), 34 states have call predecessors, (116), 34 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-08 21:10:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1230 transitions. [2024-11-08 21:10:42,316 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1230 transitions. Word has length 199 [2024-11-08 21:10:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:10:42,316 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1230 transitions. [2024-11-08 21:10:42,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.7) internal successors, (114), 18 states have internal predecessors, (114), 6 states have call successors, (55), 5 states have call predecessors, (55), 7 states have return successors, (56), 6 states have call predecessors, (56), 6 states have call successors, (56) [2024-11-08 21:10:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1230 transitions. [2024-11-08 21:10:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:10:42,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:10:42,319 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:42,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 21:10:42,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:10:42,523 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:10:42,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:10:42,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1117933825, now seen corresponding path program 1 times [2024-11-08 21:10:42,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:10:42,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252117412] [2024-11-08 21:10:42,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:10:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:10:42,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1554471935] [2024-11-08 21:10:42,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:42,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:10:42,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:10:42,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:10:42,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 21:10:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:10:42,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 21:10:42,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:10:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-08 21:10:43,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:10:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-08 21:10:46,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:10:46,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252117412] [2024-11-08 21:10:46,634 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 21:10:46,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554471935] [2024-11-08 21:10:46,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554471935] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:10:46,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:10:46,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-08 21:10:46,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544571564] [2024-11-08 21:10:46,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:10:46,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 21:10:46,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:10:46,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 21:10:46,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-08 21:10:46,636 INFO L87 Difference]: Start difference. First operand 870 states and 1230 transitions. Second operand has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 states have internal predecessors, (108), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2024-11-08 21:10:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:10:49,704 INFO L93 Difference]: Finished difference Result 2237 states and 3195 transitions. [2024-11-08 21:10:49,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 21:10:49,704 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 states have internal predecessors, (108), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) Word has length 199 [2024-11-08 21:10:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:10:49,709 INFO L225 Difference]: With dead ends: 2237 [2024-11-08 21:10:49,710 INFO L226 Difference]: Without dead ends: 1471 [2024-11-08 21:10:49,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=244, Invalid=568, Unknown=0, NotChecked=0, Total=812 [2024-11-08 21:10:49,712 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 795 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:10:49,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 921 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 21:10:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2024-11-08 21:10:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 914. [2024-11-08 21:10:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 763 states have (on average 1.3918741808650066) internal successors, (1062), 763 states have internal predecessors, (1062), 116 states have call successors, (116), 34 states have call predecessors, (116), 34 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-08 21:10:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1294 transitions. [2024-11-08 21:10:49,817 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1294 transitions. Word has length 199 [2024-11-08 21:10:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:10:49,818 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1294 transitions. [2024-11-08 21:10:49,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 states have internal predecessors, (108), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2024-11-08 21:10:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1294 transitions. [2024-11-08 21:10:49,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:10:49,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:10:49,820 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:49,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 21:10:50,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:10:50,024 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:10:50,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:10:50,025 INFO L85 PathProgramCache]: Analyzing trace with hash 96865471, now seen corresponding path program 1 times [2024-11-08 21:10:50,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:10:50,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104023745] [2024-11-08 21:10:50,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:50,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:10:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:10:50,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [295675799] [2024-11-08 21:10:50,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:10:50,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:10:50,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:10:50,103 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:10:50,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 21:10:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:10:50,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:10:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:10:50,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:10:50,414 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:10:50,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:10:50,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 21:10:50,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 21:10:50,619 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:10:50,742 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:10:50,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:10:50 BoogieIcfgContainer [2024-11-08 21:10:50,746 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:10:50,746 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:10:50,746 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:10:50,747 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:10:50,747 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:10:13" (3/4) ... [2024-11-08 21:10:50,749 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:10:50,750 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:10:50,751 INFO L158 Benchmark]: Toolchain (without parser) took 38375.73ms. Allocated memory was 119.5MB in the beginning and 599.8MB in the end (delta: 480.2MB). Free memory was 63.0MB in the beginning and 241.2MB in the end (delta: -178.2MB). Peak memory consumption was 302.6MB. Max. memory is 16.1GB. [2024-11-08 21:10:50,751 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:10:50,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.12ms. Allocated memory was 119.5MB in the beginning and 151.0MB in the end (delta: 31.5MB). Free memory was 62.8MB in the beginning and 112.1MB in the end (delta: -49.3MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-11-08 21:10:50,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.51ms. Allocated memory is still 151.0MB. Free memory was 112.1MB in the beginning and 105.1MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 21:10:50,752 INFO L158 Benchmark]: Boogie Preprocessor took 86.98ms. Allocated memory is still 151.0MB. Free memory was 105.1MB in the beginning and 97.4MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 21:10:50,752 INFO L158 Benchmark]: RCFGBuilder took 709.77ms. Allocated memory is still 151.0MB. Free memory was 97.4MB in the beginning and 109.7MB in the end (delta: -12.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-08 21:10:50,752 INFO L158 Benchmark]: TraceAbstraction took 37157.02ms. Allocated memory was 151.0MB in the beginning and 599.8MB in the end (delta: 448.8MB). Free memory was 108.8MB in the beginning and 241.2MB in the end (delta: -132.5MB). Peak memory consumption was 318.2MB. Max. memory is 16.1GB. [2024-11-08 21:10:50,752 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 599.8MB. Free memory is still 241.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:10:50,754 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.17ms. Allocated memory is still 119.5MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.12ms. Allocated memory was 119.5MB in the beginning and 151.0MB in the end (delta: 31.5MB). Free memory was 62.8MB in the beginning and 112.1MB in the end (delta: -49.3MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.51ms. Allocated memory is still 151.0MB. Free memory was 112.1MB in the beginning and 105.1MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.98ms. Allocated memory is still 151.0MB. Free memory was 105.1MB in the beginning and 97.4MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 709.77ms. Allocated memory is still 151.0MB. Free memory was 97.4MB in the beginning and 109.7MB in the end (delta: -12.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 37157.02ms. Allocated memory was 151.0MB in the beginning and 599.8MB in the end (delta: 448.8MB). Free memory was 108.8MB in the beginning and 241.2MB in the end (delta: -132.5MB). Peak memory consumption was 318.2MB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 599.8MB. Free memory is still 241.2MB. 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 197, overapproximation of someBinaryFLOATComparisonOperation at line 197, overapproximation of bitwiseOr at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_3 = 0.875; [L24] unsigned short int var_1_4 = 49926; [L25] unsigned short int var_1_5 = 500; [L26] unsigned short int var_1_6 = 10; [L27] unsigned char var_1_8 = 64; [L28] unsigned short int var_1_9 = 5; [L29] unsigned char var_1_11 = 10; [L30] float var_1_12 = 0.19999999999999996; [L31] float var_1_13 = 9.2; [L32] float var_1_14 = 5.8; [L33] float var_1_15 = 31.25; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 0; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned short int var_1_20 = 256; [L39] unsigned short int var_1_21 = 23544; [L40] unsigned long int var_1_22 = 64; [L41] double var_1_23 = 100.75; [L42] double var_1_30 = 10.3; [L43] signed long int var_1_31 = -16; [L44] unsigned char var_1_32 = 128; [L45] unsigned long int var_1_34 = 64; [L46] unsigned long int var_1_35 = 2280229334; [L47] unsigned short int var_1_36 = 4; [L48] double var_1_38 = 9.5; [L49] signed char var_1_39 = -5; [L50] signed char var_1_40 = 8; [L51] signed char var_1_41 = 8; [L52] signed char var_1_42 = -10; [L53] unsigned char var_1_43 = 1; [L54] unsigned char last_1_var_1_8 = 64; [L55] unsigned char last_1_var_1_19 = 1; [L56] unsigned short int last_1_var_1_20 = 256; [L57] unsigned long int last_1_var_1_22 = 64; VAL [isInitial=0, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_3=7/8, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L201] isInitial = 1 [L202] FCALL initially() [L203] COND TRUE 1 [L204] CALL updateLastVariables() [L191] last_1_var_1_8 = var_1_8 [L192] last_1_var_1_19 = var_1_19 [L193] last_1_var_1_20 = var_1_20 [L194] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_3=7/8, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L204] RET updateLastVariables() [L205] CALL updateVariables() [L144] var_1_3 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L145] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L146] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L146] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L147] var_1_4 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L148] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L149] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L149] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L150] var_1_5 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_6=10, var_1_8=64, var_1_9=5] [L151] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_6=10, var_1_8=64, var_1_9=5] [L152] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=10, var_1_8=64, var_1_9=5] [L152] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=10, var_1_8=64, var_1_9=5] [L153] var_1_6 = __VERIFIER_nondet_ushort() [L154] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_8=64, var_1_9=5] [L154] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_8=64, var_1_9=5] [L155] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=5] [L155] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=5] [L156] var_1_9 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64] [L157] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64] [L158] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L158] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L159] var_1_11 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L160] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L161] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L161] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L162] var_1_13 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L163] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L164] var_1_14 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L165] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L166] var_1_15 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L167] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L168] var_1_17 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L169] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L170] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L170] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L171] var_1_18 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L172] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L173] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L173] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L174] var_1_21 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L175] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L176] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L176] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=2280229334, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L177] var_1_35 = __VERIFIER_nondet_ulong() [L178] CALL assume_abort_if_not(var_1_35 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L178] RET assume_abort_if_not(var_1_35 >= 2147483647) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L179] CALL assume_abort_if_not(var_1_35 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L179] RET assume_abort_if_not(var_1_35 <= 4294967294) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=8, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L180] var_1_40 = __VERIFIER_nondet_char() [L181] CALL assume_abort_if_not(var_1_40 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L181] RET assume_abort_if_not(var_1_40 >= -127) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L182] CALL assume_abort_if_not(var_1_40 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L182] RET assume_abort_if_not(var_1_40 <= 126) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=8, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L183] var_1_41 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L184] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L185] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L185] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-10, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L186] var_1_42 = __VERIFIER_nondet_char() [L187] CALL assume_abort_if_not(var_1_42 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L187] RET assume_abort_if_not(var_1_42 >= -126) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L188] CALL assume_abort_if_not(var_1_42 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L188] RET assume_abort_if_not(var_1_42 <= 126) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L205] RET updateVariables() [L206] CALL step() [L61] COND TRUE (last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22) [L62] var_1_16 = (last_1_var_1_19 || var_1_17) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L66] unsigned short int stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_0=-65536, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L67] COND FALSE !(stepLocal_0 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L72] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_2=49150, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L73] COND TRUE var_1_8 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L74] COND TRUE \read(var_1_16) [L75] var_1_20 = (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L82] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L83] COND FALSE !((var_1_8 * var_1_8) < var_1_11) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L89] COND TRUE var_1_12 >= (1.3 / var_1_3) [L90] var_1_1 = ((var_1_4 - var_1_8) - var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L94] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L95] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L96] COND TRUE stepLocal_1 || var_1_16 [L97] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L100] EXPR 2 ^ var_1_20 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L100] EXPR (((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L100] COND FALSE !(var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) [L103] COND FALSE !(var_1_13 <= var_1_3) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=103/10, var_1_31=-16, var_1_32=128, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L110] var_1_30 = var_1_15 [L111] var_1_31 = var_1_9 [L112] var_1_32 = var_1_11 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=64, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L113] COND TRUE var_1_15 > 32.8 [L114] var_1_34 = (((((var_1_35 - var_1_8)) > (var_1_21)) ? ((var_1_35 - var_1_8)) : (var_1_21))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=70866960319, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L116] EXPR var_1_8 & var_1_11 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=70866960319, var_1_35=70866960383, var_1_36=4, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L116] COND TRUE (var_1_8 & var_1_11) <= var_1_8 [L117] var_1_36 = 10 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=70866960319, var_1_35=70866960383, var_1_36=10, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L127] EXPR var_1_6 | (var_1_5 + var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=70866960319, var_1_35=70866960383, var_1_36=10, var_1_38=19/2, var_1_39=-5, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L127] COND FALSE !(var_1_11 == (var_1_6 | (var_1_5 + var_1_8))) [L130] COND TRUE var_1_14 >= var_1_3 [L131] var_1_39 = ((((var_1_40) < (var_1_41)) ? (var_1_40) : (var_1_41))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=70866960319, var_1_35=70866960383, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L135] COND FALSE !((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) / var_1_4) > (var_1_6 * 10)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=70866960319, var_1_35=70866960383, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L206] RET step() [L207] CALL, EXPR property() [L197] EXPR (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=70866960319, var_1_35=70866960383, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L197-L198] return (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) ; [L207] RET, EXPR property() [L207] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=70866960319, var_1_35=70866960383, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_30=2, var_1_31=64, var_1_32=0, var_1_34=70866960319, var_1_35=70866960383, var_1_36=10, var_1_38=19/2, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=-126, var_1_43=1, var_1_4=49150, var_1_5=-65536, var_1_6=64, var_1_8=64, var_1_9=-65472] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.0s, OverallIterations: 13, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6971 SdHoareTripleChecker+Valid, 11.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6956 mSDsluCounter, 12669 SdHoareTripleChecker+Invalid, 9.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10096 mSDsCounter, 1427 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11761 IncrementalHoareTripleChecker+Invalid, 13188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1427 mSolverCounterUnsat, 2573 mSDtfsCounter, 11761 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2502 GetRequests, 2146 SyntacticMatches, 1 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12485 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1340occurred in iteration=7, InterpolantAutomatonStates: 308, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 4933 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 3549 NumberOfCodeBlocks, 3549 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3528 ConstructedInterpolants, 0 QuantifiedInterpolants, 22196 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1849 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 27981/29232 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 21:10:50,860 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-pe-ci_file-47.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 72a058d8f1934b68fcbca0a1da7b19bbf59cfe4d4b87abeecd729ed9998e917c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:10:52,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:10:52,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:10:52,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:10:52,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:10:52,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:10:52,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:10:52,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:10:52,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:10:52,829 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:10:52,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:10:52,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:10:52,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:10:52,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:10:52,833 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:10:52,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:10:52,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:10:52,834 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:10:52,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:10:52,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:10:52,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:10:52,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:10:52,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:10:52,836 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:10:52,836 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:10:52,836 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:10:52,837 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:10:52,837 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:10:52,837 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:10:52,837 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:10:52,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:10:52,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:10:52,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:10:52,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:10:52,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:10:52,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:10:52,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:10:52,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:10:52,838 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:10:52,838 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:10:52,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:10:52,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:10:52,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:10:52,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:10:52,842 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 -> 72a058d8f1934b68fcbca0a1da7b19bbf59cfe4d4b87abeecd729ed9998e917c [2024-11-08 21:10:53,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:10:53,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:10:53,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:10:53,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:10:53,151 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:10:53,152 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-pe-ci_file-47.i [2024-11-08 21:10:54,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:10:54,713 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:10:54,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-47.i [2024-11-08 21:10:54,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9c82e42/a9eef9400cf44c1c9370ce6d3e82a554/FLAG905b38501 [2024-11-08 21:10:54,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9c82e42/a9eef9400cf44c1c9370ce6d3e82a554 [2024-11-08 21:10:54,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:10:54,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:10:54,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:10:54,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:10:54,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:10:54,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:10:54" (1/1) ... [2024-11-08 21:10:54,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4abd762b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:54, skipping insertion in model container [2024-11-08 21:10:54,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:10:54" (1/1) ... [2024-11-08 21:10:54,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:10:54,947 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-pe-ci_file-47.i[919,932] [2024-11-08 21:10:55,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:10:55,042 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:10:55,054 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-pe-ci_file-47.i[919,932] [2024-11-08 21:10:55,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:10:55,108 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:10:55,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:55 WrapperNode [2024-11-08 21:10:55,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:10:55,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:10:55,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:10:55,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:10:55,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:55" (1/1) ... [2024-11-08 21:10:55,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:55" (1/1) ... [2024-11-08 21:10:55,156 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-11-08 21:10:55,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:10:55,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:10:55,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:10:55,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:10:55,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:55" (1/1) ... [2024-11-08 21:10:55,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:55" (1/1) ... [2024-11-08 21:10:55,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:55" (1/1) ... [2024-11-08 21:10:55,200 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:10:55,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:55" (1/1) ... [2024-11-08 21:10:55,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:55" (1/1) ... [2024-11-08 21:10:55,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:55" (1/1) ... [2024-11-08 21:10:55,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:55" (1/1) ... [2024-11-08 21:10:55,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:55" (1/1) ... [2024-11-08 21:10:55,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:55" (1/1) ... [2024-11-08 21:10:55,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:10:55,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:10:55,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:10:55,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:10:55,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:55" (1/1) ... [2024-11-08 21:10:55,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:10:55,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:10:55,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:10:55,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:10:55,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:10:55,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:10:55,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:10:55,309 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:10:55,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:10:55,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:10:55,380 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:10:55,382 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:11:07,347 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 21:11:07,348 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:11:07,358 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:11:07,359 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:11:07,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:11:07 BoogieIcfgContainer [2024-11-08 21:11:07,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:11:07,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:11:07,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:11:07,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:11:07,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:10:54" (1/3) ... [2024-11-08 21:11:07,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f38494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:11:07, skipping insertion in model container [2024-11-08 21:11:07,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:10:55" (2/3) ... [2024-11-08 21:11:07,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f38494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:11:07, skipping insertion in model container [2024-11-08 21:11:07,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:11:07" (3/3) ... [2024-11-08 21:11:07,366 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-47.i [2024-11-08 21:11:07,377 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:11:07,378 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:11:07,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:11:07,427 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;@21b62a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:11:07,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:11:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:11:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 21:11:07,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:11:07,441 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:11:07,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:11:07,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:11:07,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1928057927, now seen corresponding path program 1 times [2024-11-08 21:11:07,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:11:07,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821103928] [2024-11-08 21:11:07,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:11:07,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:11:07,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:11:07,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:11:07,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 21:11:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:11:08,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:11:08,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:11:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-08 21:11:08,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:11:08,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:11:08,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821103928] [2024-11-08 21:11:08,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821103928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:11:08,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:11:08,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:11:08,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177116433] [2024-11-08 21:11:08,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:11:08,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:11:08,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:11:08,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:11:08,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:11:08,463 INFO L87 Difference]: Start difference. First operand has 90 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:11:08,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:11:08,490 INFO L93 Difference]: Finished difference Result 171 states and 305 transitions. [2024-11-08 21:11:08,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:11:08,492 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2024-11-08 21:11:08,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:11:08,497 INFO L225 Difference]: With dead ends: 171 [2024-11-08 21:11:08,498 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 21:11:08,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:11:08,504 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:11:08,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:11:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 21:11:08,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-08 21:11:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:11:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2024-11-08 21:11:08,550 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 131 transitions. Word has length 187 [2024-11-08 21:11:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:11:08,551 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 131 transitions. [2024-11-08 21:11:08,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:11:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 131 transitions. [2024-11-08 21:11:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 21:11:08,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:11:08,554 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:11:08,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 21:11:08,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:11:08,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:11:08,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:11:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash -929409741, now seen corresponding path program 1 times [2024-11-08 21:11:08,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:11:08,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624339877] [2024-11-08 21:11:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:11:08,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:11:08,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:11:08,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:11:08,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 21:11:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:11:09,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 21:11:09,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:11:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-08 21:11:13,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:11:13,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:11:13,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624339877] [2024-11-08 21:11:13,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624339877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:11:13,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [778658362] [2024-11-08 21:11:13,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:11:13,588 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 21:11:13,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 21:11:13,590 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 21:11:13,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-08 21:11:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:11:15,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 21:11:15,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:11:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:11:19,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:11:19,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [778658362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:11:19,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 21:11:19,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-08 21:11:19,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026919718] [2024-11-08 21:11:19,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:11:19,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:11:19,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:11:19,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:11:19,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:11:19,532 INFO L87 Difference]: Start difference. First operand 84 states and 131 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:11:24,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:11:28,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []