./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.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 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:25:25,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:25:25,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:25:25,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:25:25,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:25:25,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:25:25,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:25:25,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:25:25,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:25:25,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:25:25,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:25:25,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:25:25,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:25:25,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:25:25,628 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:25:25,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:25:25,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:25:25,629 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:25:25,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:25:25,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:25:25,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:25:25,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:25:25,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:25:25,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:25:25,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:25:25,632 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:25:25,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:25:25,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:25:25,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:25:25,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:25:25,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:25:25,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:25:25,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:25:25,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:25:25,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:25:25,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:25:25,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:25:25,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:25:25,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:25:25,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:25:25,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:25:25,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:25:25,636 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 -> 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 [2024-11-20 06:25:25,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:25:25,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:25:25,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:25:25,872 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:25:25,876 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:25:25,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-20 06:25:27,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:25:27,364 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:25:27,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-20 06:25:27,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fd594e8a/e362f61920ad466e8358b0ffd6889202/FLAG776c3ea4d [2024-11-20 06:25:27,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fd594e8a/e362f61920ad466e8358b0ffd6889202 [2024-11-20 06:25:27,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:25:27,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:25:27,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:25:27,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:25:27,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:25:27,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:25:27" (1/1) ... [2024-11-20 06:25:27,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a341c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27, skipping insertion in model container [2024-11-20 06:25:27,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:25:27" (1/1) ... [2024-11-20 06:25:27,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:25:27,597 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_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-20 06:25:27,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:25:27,705 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:25:27,717 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_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-20 06:25:27,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:25:27,781 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:25:27,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27 WrapperNode [2024-11-20 06:25:27,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:25:27,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:25:27,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:25:27,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:25:27,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27" (1/1) ... [2024-11-20 06:25:27,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27" (1/1) ... [2024-11-20 06:25:27,864 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-11-20 06:25:27,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:25:27,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:25:27,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:25:27,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:25:27,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27" (1/1) ... [2024-11-20 06:25:27,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27" (1/1) ... [2024-11-20 06:25:27,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27" (1/1) ... [2024-11-20 06:25:27,920 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-20 06:25:27,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27" (1/1) ... [2024-11-20 06:25:27,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27" (1/1) ... [2024-11-20 06:25:27,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27" (1/1) ... [2024-11-20 06:25:27,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27" (1/1) ... [2024-11-20 06:25:27,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27" (1/1) ... [2024-11-20 06:25:27,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27" (1/1) ... [2024-11-20 06:25:27,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:25:27,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:25:27,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:25:27,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:25:27,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27" (1/1) ... [2024-11-20 06:25:27,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:25:27,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:25:27,999 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-20 06:25:28,005 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-20 06:25:28,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:25:28,037 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:25:28,038 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:25:28,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:25:28,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:25:28,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:25:28,109 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:25:28,112 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:25:28,633 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-20 06:25:28,633 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:25:28,649 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:25:28,649 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:25:28,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:25:28 BoogieIcfgContainer [2024-11-20 06:25:28,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:25:28,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:25:28,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:25:28,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:25:28,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:25:27" (1/3) ... [2024-11-20 06:25:28,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6511d830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:25:28, skipping insertion in model container [2024-11-20 06:25:28,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:27" (2/3) ... [2024-11-20 06:25:28,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6511d830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:25:28, skipping insertion in model container [2024-11-20 06:25:28,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:25:28" (3/3) ... [2024-11-20 06:25:28,659 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-20 06:25:28,673 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:25:28,674 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:25:28,747 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:25:28,754 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;@6fdeaea6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:25:28,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:25:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-20 06:25:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 06:25:28,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:28,775 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:25:28,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:28,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:28,781 INFO L85 PathProgramCache]: Analyzing trace with hash -531509665, now seen corresponding path program 1 times [2024-11-20 06:25:28,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:28,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130537639] [2024-11-20 06:25:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:28,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:25:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:25:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:25:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:25:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:25:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:25:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:25:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:25:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:25:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:25:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:25:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:25:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:25:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:25:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:25:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:25:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:25:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:25:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:25:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:25:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:25:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:25:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:25:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:25:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:25:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 06:25:29,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:25:29,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130537639] [2024-11-20 06:25:29,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130537639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:25:29,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:25:29,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:25:29,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183260019] [2024-11-20 06:25:29,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:25:29,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:25:29,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:25:29,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:25:29,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:25:29,245 INFO L87 Difference]: Start difference. First operand has 96 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-20 06:25:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:25:29,275 INFO L93 Difference]: Finished difference Result 185 states and 317 transitions. [2024-11-20 06:25:29,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:25:29,279 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2024-11-20 06:25:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:25:29,288 INFO L225 Difference]: With dead ends: 185 [2024-11-20 06:25:29,288 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 06:25:29,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-20 06:25:29,294 INFO L432 NwaCegarLoop]: 142 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, 142 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-20 06:25:29,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:25:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 06:25:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-20 06:25:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 states have internal predecessors, (92), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-20 06:25:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 142 transitions. [2024-11-20 06:25:29,346 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 142 transitions. Word has length 170 [2024-11-20 06:25:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:25:29,347 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 142 transitions. [2024-11-20 06:25:29,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-20 06:25:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 142 transitions. [2024-11-20 06:25:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 06:25:29,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:29,354 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:25:29,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:25:29,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:29,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:29,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1528999847, now seen corresponding path program 1 times [2024-11-20 06:25:29,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:29,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974881139] [2024-11-20 06:25:29,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:29,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:25:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:25:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:25:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:25:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:25:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:25:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:25:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:25:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:25:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:25:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:25:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:25:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:25:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:25:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:25:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:25:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:25:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:25:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:25:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:25:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:25:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:25:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:25:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:25:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:25:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 06:25:30,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:25:30,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974881139] [2024-11-20 06:25:30,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974881139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:25:30,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:25:30,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:25:30,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629613571] [2024-11-20 06:25:30,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:25:30,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:25:30,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:25:30,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:25:30,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:25:30,113 INFO L87 Difference]: Start difference. First operand 92 states and 142 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:25:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:25:30,192 INFO L93 Difference]: Finished difference Result 230 states and 353 transitions. [2024-11-20 06:25:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:25:30,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-20 06:25:30,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:25:30,196 INFO L225 Difference]: With dead ends: 230 [2024-11-20 06:25:30,199 INFO L226 Difference]: Without dead ends: 141 [2024-11-20 06:25:30,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-20 06:25:30,200 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 64 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:25:30,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:25:30,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-20 06:25:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-11-20 06:25:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 103 states have (on average 1.4368932038834952) internal successors, (148), 104 states have internal predecessors, (148), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-20 06:25:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 210 transitions. [2024-11-20 06:25:30,226 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 210 transitions. Word has length 170 [2024-11-20 06:25:30,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:25:30,227 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 210 transitions. [2024-11-20 06:25:30,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:25:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 210 transitions. [2024-11-20 06:25:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 06:25:30,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:30,229 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:25:30,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:25:30,231 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:30,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:30,231 INFO L85 PathProgramCache]: Analyzing trace with hash 246007515, now seen corresponding path program 1 times [2024-11-20 06:25:30,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:30,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667623469] [2024-11-20 06:25:30,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:30,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:25:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:25:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:25:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:25:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:25:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:25:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:25:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:25:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:25:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:25:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:25:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:25:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:25:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:25:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:25:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:25:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:25:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:25:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:25:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:25:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:25:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:25:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:25:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:25:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:25:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 06:25:36,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:25:36,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667623469] [2024-11-20 06:25:36,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667623469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:25:36,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:25:36,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 06:25:36,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699479183] [2024-11-20 06:25:36,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:25:36,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 06:25:36,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:25:36,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 06:25:36,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-20 06:25:36,938 INFO L87 Difference]: Start difference. First operand 137 states and 210 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:25:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:25:40,970 INFO L93 Difference]: Finished difference Result 616 states and 938 transitions. [2024-11-20 06:25:40,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 06:25:40,970 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-20 06:25:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:25:40,975 INFO L225 Difference]: With dead ends: 616 [2024-11-20 06:25:40,976 INFO L226 Difference]: Without dead ends: 482 [2024-11-20 06:25:40,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2024-11-20 06:25:40,977 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 743 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-20 06:25:40,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 747 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-20 06:25:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-20 06:25:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 215. [2024-11-20 06:25:40,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 154 states have (on average 1.4090909090909092) internal successors, (217), 155 states have internal predecessors, (217), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 06:25:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 329 transitions. [2024-11-20 06:25:41,000 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 329 transitions. Word has length 170 [2024-11-20 06:25:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:25:41,001 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 329 transitions. [2024-11-20 06:25:41,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:25:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 329 transitions. [2024-11-20 06:25:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 06:25:41,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:41,003 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:25:41,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:25:41,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:41,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash -12157923, now seen corresponding path program 1 times [2024-11-20 06:25:41,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:41,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111488297] [2024-11-20 06:25:41,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:41,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:25:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:25:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:25:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:25:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:25:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:25:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:25:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:25:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:25:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:25:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:25:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:25:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:25:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:25:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:25:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:25:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:25:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:25:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:25:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:25:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:25:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:25:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:25:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:25:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:25:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 06:25:45,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:25:45,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111488297] [2024-11-20 06:25:45,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111488297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:25:45,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:25:45,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 06:25:45,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638929603] [2024-11-20 06:25:45,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:25:45,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 06:25:45,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:25:45,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 06:25:45,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-20 06:25:45,455 INFO L87 Difference]: Start difference. First operand 215 states and 329 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-20 06:25:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:25:48,923 INFO L93 Difference]: Finished difference Result 606 states and 928 transitions. [2024-11-20 06:25:48,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 06:25:48,924 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2024-11-20 06:25:48,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:25:48,928 INFO L225 Difference]: With dead ends: 606 [2024-11-20 06:25:48,928 INFO L226 Difference]: Without dead ends: 472 [2024-11-20 06:25:48,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2024-11-20 06:25:48,933 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 622 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-20 06:25:48,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 864 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-20 06:25:48,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-20 06:25:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 240. [2024-11-20 06:25:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 179 states have (on average 1.441340782122905) internal successors, (258), 180 states have internal predecessors, (258), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 06:25:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 370 transitions. [2024-11-20 06:25:48,968 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 370 transitions. Word has length 170 [2024-11-20 06:25:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:25:48,969 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 370 transitions. [2024-11-20 06:25:48,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-20 06:25:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 370 transitions. [2024-11-20 06:25:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 06:25:48,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:48,976 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:25:48,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:25:48,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:48,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash -765109735, now seen corresponding path program 1 times [2024-11-20 06:25:48,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:48,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181937069] [2024-11-20 06:25:48,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:48,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:25:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:25:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:25:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:25:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:25:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:25:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:25:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:25:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:25:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:25:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:25:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:25:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:25:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:25:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:25:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:25:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:25:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:25:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:25:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:25:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:25:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:25:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:25:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:25:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:25:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 06:25:50,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:25:50,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181937069] [2024-11-20 06:25:50,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181937069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:25:50,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:25:50,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:25:50,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768443891] [2024-11-20 06:25:50,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:25:50,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:25:50,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:25:50,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:25:50,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:25:50,801 INFO L87 Difference]: Start difference. First operand 240 states and 370 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:25:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:25:52,093 INFO L93 Difference]: Finished difference Result 555 states and 853 transitions. [2024-11-20 06:25:52,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 06:25:52,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-20 06:25:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:25:52,096 INFO L225 Difference]: With dead ends: 555 [2024-11-20 06:25:52,097 INFO L226 Difference]: Without dead ends: 421 [2024-11-20 06:25:52,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-20 06:25:52,098 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 447 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 06:25:52,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 566 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 06:25:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-20 06:25:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 240. [2024-11-20 06:25:52,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 179 states have (on average 1.441340782122905) internal successors, (258), 180 states have internal predecessors, (258), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 06:25:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 370 transitions. [2024-11-20 06:25:52,114 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 370 transitions. Word has length 170 [2024-11-20 06:25:52,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:25:52,114 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 370 transitions. [2024-11-20 06:25:52,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:25:52,114 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 370 transitions. [2024-11-20 06:25:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 06:25:52,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:52,116 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:25:52,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 06:25:52,116 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:52,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:52,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1278840773, now seen corresponding path program 1 times [2024-11-20 06:25:52,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:52,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128442701] [2024-11-20 06:25:52,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:52,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:25:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:25:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:25:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:25:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:25:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:25:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:25:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:25:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:25:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:25:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:25:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:25:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:25:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:25:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:25:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:25:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:25:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:25:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:25:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:25:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:25:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:25:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:25:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:25:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:25:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 06:25:52,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:25:52,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128442701] [2024-11-20 06:25:52,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128442701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:25:52,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:25:52,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 06:25:52,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272975788] [2024-11-20 06:25:52,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:25:52,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:25:52,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:25:52,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:25:52,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:25:52,553 INFO L87 Difference]: Start difference. First operand 240 states and 370 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:25:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:25:53,029 INFO L93 Difference]: Finished difference Result 657 states and 1010 transitions. [2024-11-20 06:25:53,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 06:25:53,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-20 06:25:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:25:53,032 INFO L225 Difference]: With dead ends: 657 [2024-11-20 06:25:53,032 INFO L226 Difference]: Without dead ends: 523 [2024-11-20 06:25:53,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:25:53,036 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 316 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 06:25:53,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1164 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 06:25:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-20 06:25:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 274. [2024-11-20 06:25:53,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 213 states have (on average 1.4694835680751173) internal successors, (313), 214 states have internal predecessors, (313), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 06:25:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 425 transitions. [2024-11-20 06:25:53,066 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 425 transitions. Word has length 171 [2024-11-20 06:25:53,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:25:53,066 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 425 transitions. [2024-11-20 06:25:53,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:25:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 425 transitions. [2024-11-20 06:25:53,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 06:25:53,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:53,068 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:25:53,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 06:25:53,068 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:53,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:53,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1020675335, now seen corresponding path program 1 times [2024-11-20 06:25:53,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:53,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971192321] [2024-11-20 06:25:53,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:53,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:25:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:25:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:25:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:25:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:25:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:25:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:25:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:25:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:25:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:25:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:25:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:25:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:25:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:25:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:25:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:25:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:25:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:25:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:25:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:25:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:25:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:25:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:25:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:25:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:25:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 06:25:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:25:54,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971192321] [2024-11-20 06:25:54,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971192321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:25:54,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:25:54,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 06:25:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119219120] [2024-11-20 06:25:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:25:54,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:25:54,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:25:54,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:25:54,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:25:54,746 INFO L87 Difference]: Start difference. First operand 274 states and 425 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:25:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:25:55,766 INFO L93 Difference]: Finished difference Result 724 states and 1123 transitions. [2024-11-20 06:25:55,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 06:25:55,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-20 06:25:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:25:55,774 INFO L225 Difference]: With dead ends: 724 [2024-11-20 06:25:55,774 INFO L226 Difference]: Without dead ends: 590 [2024-11-20 06:25:55,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:25:55,775 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 253 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 06:25:55,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 601 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 06:25:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-20 06:25:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 314. [2024-11-20 06:25:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 253 states have (on average 1.4940711462450593) internal successors, (378), 254 states have internal predecessors, (378), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 06:25:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 490 transitions. [2024-11-20 06:25:55,791 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 490 transitions. Word has length 171 [2024-11-20 06:25:55,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:25:55,791 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 490 transitions. [2024-11-20 06:25:55,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:25:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 490 transitions. [2024-11-20 06:25:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 06:25:55,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:55,793 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:25:55,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 06:25:55,793 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:55,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:55,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1144827267, now seen corresponding path program 1 times [2024-11-20 06:25:55,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:55,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482823296] [2024-11-20 06:25:55,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:55,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:25:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:25:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:25:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:25:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:25:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:25:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:25:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:25:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:25:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:25:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:25:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:25:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:25:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:25:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:25:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:25:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:25:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:25:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:25:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:25:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:25:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:25:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:25:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:25:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:25:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 06:25:55,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:25:55,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482823296] [2024-11-20 06:25:55,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482823296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:25:55,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:25:55,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:25:55,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582424728] [2024-11-20 06:25:55,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:25:55,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:25:55,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:25:55,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:25:55,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:25:55,900 INFO L87 Difference]: Start difference. First operand 314 states and 490 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:25:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:25:55,991 INFO L93 Difference]: Finished difference Result 732 states and 1140 transitions. [2024-11-20 06:25:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 06:25:55,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-20 06:25:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:25:55,996 INFO L225 Difference]: With dead ends: 732 [2024-11-20 06:25:55,996 INFO L226 Difference]: Without dead ends: 552 [2024-11-20 06:25:55,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-20 06:25:55,997 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 138 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:25:55,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 427 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:25:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-20 06:25:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 441. [2024-11-20 06:25:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 369 states have (on average 1.4878048780487805) internal successors, (549), 372 states have internal predecessors, (549), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 06:25:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 677 transitions. [2024-11-20 06:25:56,020 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 677 transitions. Word has length 171 [2024-11-20 06:25:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:25:56,021 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 677 transitions. [2024-11-20 06:25:56,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:25:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 677 transitions. [2024-11-20 06:25:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 06:25:56,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:56,022 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:25:56,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 06:25:56,022 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:56,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:56,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2147292940, now seen corresponding path program 1 times [2024-11-20 06:25:56,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:56,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590935897] [2024-11-20 06:25:56,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:56,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:26:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:26:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:26:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:26:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:26:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:26:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:26:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:26:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:26:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:26:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:26:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:26:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:26:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:26:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:26:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:26:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:26:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:26:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:26:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:26:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:26:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:26:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:26:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:26:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:26:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 06:26:00,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:26:00,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590935897] [2024-11-20 06:26:00,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590935897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:26:00,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:26:00,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-20 06:26:00,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094088327] [2024-11-20 06:26:00,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:26:00,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 06:26:00,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:26:00,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 06:26:00,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-20 06:26:00,869 INFO L87 Difference]: Start difference. First operand 441 states and 677 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-20 06:26:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:26:05,315 INFO L93 Difference]: Finished difference Result 1439 states and 2189 transitions. [2024-11-20 06:26:05,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 06:26:05,316 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 171 [2024-11-20 06:26:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:26:05,321 INFO L225 Difference]: With dead ends: 1439 [2024-11-20 06:26:05,321 INFO L226 Difference]: Without dead ends: 1182 [2024-11-20 06:26:05,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2024-11-20 06:26:05,325 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1180 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-20 06:26:05,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1038 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-20 06:26:05,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-11-20 06:26:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 458. [2024-11-20 06:26:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 386 states have (on average 1.494818652849741) internal successors, (577), 389 states have internal predecessors, (577), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 06:26:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 705 transitions. [2024-11-20 06:26:05,351 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 705 transitions. Word has length 171 [2024-11-20 06:26:05,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:26:05,351 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 705 transitions. [2024-11-20 06:26:05,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-20 06:26:05,352 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 705 transitions. [2024-11-20 06:26:05,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 06:26:05,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:26:05,354 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:26:05,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 06:26:05,354 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:26:05,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:26:05,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1889508918, now seen corresponding path program 1 times [2024-11-20 06:26:05,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:26:05,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705933603] [2024-11-20 06:26:05,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:05,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:26:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:26:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:26:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:26:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:26:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:26:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:26:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:26:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:26:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:26:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:26:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:26:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:26:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:26:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:26:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:26:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:26:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:26:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:26:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:26:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:26:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:26:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:26:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:26:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:26:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:26:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 06:26:07,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:26:07,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705933603] [2024-11-20 06:26:07,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705933603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:26:07,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:26:07,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 06:26:07,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475688311] [2024-11-20 06:26:07,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:26:07,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 06:26:07,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:26:07,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 06:26:07,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:26:07,427 INFO L87 Difference]: Start difference. First operand 458 states and 705 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:26:08,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:26:08,629 INFO L93 Difference]: Finished difference Result 1164 states and 1781 transitions. [2024-11-20 06:26:08,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 06:26:08,630 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-20 06:26:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:26:08,634 INFO L225 Difference]: With dead ends: 1164 [2024-11-20 06:26:08,634 INFO L226 Difference]: Without dead ends: 907 [2024-11-20 06:26:08,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-20 06:26:08,636 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 311 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 06:26:08,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 573 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 06:26:08,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-20 06:26:08,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 443. [2024-11-20 06:26:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 371 states have (on average 1.4878706199460916) internal successors, (552), 374 states have internal predecessors, (552), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 06:26:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 680 transitions. [2024-11-20 06:26:08,662 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 680 transitions. Word has length 171 [2024-11-20 06:26:08,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:26:08,662 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 680 transitions. [2024-11-20 06:26:08,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:26:08,663 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 680 transitions. [2024-11-20 06:26:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 06:26:08,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:26:08,665 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:26:08,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 06:26:08,665 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:26:08,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:26:08,666 INFO L85 PathProgramCache]: Analyzing trace with hash -929825386, now seen corresponding path program 1 times [2024-11-20 06:26:08,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:26:08,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96389903] [2024-11-20 06:26:08,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:08,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:26:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:26:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:26:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:26:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:26:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:26:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:26:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:26:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:26:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:26:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:26:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:26:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:26:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:26:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:26:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:26:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:26:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:26:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:26:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:26:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:26:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:26:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:26:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:26:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:26:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:26:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-20 06:26:09,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:26:09,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96389903] [2024-11-20 06:26:09,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96389903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:26:09,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169345293] [2024-11-20 06:26:09,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:09,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:26:09,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:26:09,540 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-20 06:26:09,542 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-20 06:26:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 06:26:09,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:26:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 78 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-20 06:26:09,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:26:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-20 06:26:10,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169345293] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:26:10,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:26:10,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 21 [2024-11-20 06:26:10,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599150132] [2024-11-20 06:26:10,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:26:10,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-20 06:26:10,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:26:10,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-20 06:26:10,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-20 06:26:10,176 INFO L87 Difference]: Start difference. First operand 443 states and 680 transitions. Second operand has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-11-20 06:26:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:26:13,013 INFO L93 Difference]: Finished difference Result 2256 states and 3315 transitions. [2024-11-20 06:26:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-20 06:26:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) Word has length 172 [2024-11-20 06:26:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:26:13,020 INFO L225 Difference]: With dead ends: 2256 [2024-11-20 06:26:13,021 INFO L226 Difference]: Without dead ends: 1919 [2024-11-20 06:26:13,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 389 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2243 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1056, Invalid=6254, Unknown=0, NotChecked=0, Total=7310 [2024-11-20 06:26:13,024 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 2153 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2165 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 06:26:13,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2165 Valid, 1508 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 06:26:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2024-11-20 06:26:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 606. [2024-11-20 06:26:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 529 states have (on average 1.440453686200378) internal successors, (762), 532 states have internal predecessors, (762), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 06:26:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 890 transitions. [2024-11-20 06:26:13,061 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 890 transitions. Word has length 172 [2024-11-20 06:26:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:26:13,061 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 890 transitions. [2024-11-20 06:26:13,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-11-20 06:26:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 890 transitions. [2024-11-20 06:26:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 06:26:13,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:26:13,063 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:26:13,073 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-20 06:26:13,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-20 06:26:13,264 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:26:13,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:26:13,265 INFO L85 PathProgramCache]: Analyzing trace with hash 81291864, now seen corresponding path program 1 times [2024-11-20 06:26:13,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:26:13,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101195537] [2024-11-20 06:26:13,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:13,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:26:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:26:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:26:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:26:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:26:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:26:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:26:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:26:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:26:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:26:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:26:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:26:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:26:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:26:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:26:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:26:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:26:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:26:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:26:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:26:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:26:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:26:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:26:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:26:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:26:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:26:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-20 06:26:13,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:26:13,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101195537] [2024-11-20 06:26:13,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101195537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:26:13,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327319778] [2024-11-20 06:26:13,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:13,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:26:13,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:26:13,704 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-20 06:26:13,706 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-20 06:26:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:13,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 06:26:13,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:26:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 204 proven. 66 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2024-11-20 06:26:14,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:26:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-20 06:26:14,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327319778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:26:14,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:26:14,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2024-11-20 06:26:14,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626780569] [2024-11-20 06:26:14,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:26:14,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-20 06:26:14,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:26:14,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-20 06:26:14,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2024-11-20 06:26:14,736 INFO L87 Difference]: Start difference. First operand 606 states and 890 transitions. Second operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2024-11-20 06:26:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:26:15,955 INFO L93 Difference]: Finished difference Result 1364 states and 1972 transitions. [2024-11-20 06:26:15,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-20 06:26:15,956 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) Word has length 172 [2024-11-20 06:26:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:26:15,959 INFO L225 Difference]: With dead ends: 1364 [2024-11-20 06:26:15,959 INFO L226 Difference]: Without dead ends: 977 [2024-11-20 06:26:15,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=473, Invalid=1879, Unknown=0, NotChecked=0, Total=2352 [2024-11-20 06:26:15,962 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 1127 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 06:26:15,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 982 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 06:26:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-20 06:26:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 571. [2024-11-20 06:26:15,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 493 states have (on average 1.4198782961460445) internal successors, (700), 496 states have internal predecessors, (700), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 06:26:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 828 transitions. [2024-11-20 06:26:15,990 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 828 transitions. Word has length 172 [2024-11-20 06:26:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:26:15,991 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 828 transitions. [2024-11-20 06:26:15,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2024-11-20 06:26:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 828 transitions. [2024-11-20 06:26:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 06:26:15,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:26:15,993 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:26:16,000 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-20 06:26:16,193 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,SelfDestructingSolverStorable11 [2024-11-20 06:26:16,194 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:26:16,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:26:16,194 INFO L85 PathProgramCache]: Analyzing trace with hash 677651176, now seen corresponding path program 1 times [2024-11-20 06:26:16,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:26:16,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759709920] [2024-11-20 06:26:16,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:16,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:26:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:26:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:26:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:26:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:26:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:26:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:26:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:26:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:26:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:26:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:26:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:26:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:26:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:26:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:26:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:26:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:26:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:26:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:26:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:26:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:26:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:26:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:26:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:26:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:26:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:26:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 06:26:16,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:26:16,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759709920] [2024-11-20 06:26:16,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759709920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:26:16,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:26:16,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:26:16,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121145884] [2024-11-20 06:26:16,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:26:16,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:26:16,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:26:16,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:26:16,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:26:16,340 INFO L87 Difference]: Start difference. First operand 571 states and 828 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:26:16,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:26:16,459 INFO L93 Difference]: Finished difference Result 982 states and 1429 transitions. [2024-11-20 06:26:16,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:26:16,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2024-11-20 06:26:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:26:16,462 INFO L225 Difference]: With dead ends: 982 [2024-11-20 06:26:16,462 INFO L226 Difference]: Without dead ends: 585 [2024-11-20 06:26:16,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:26:16,464 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 59 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:26:16,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 369 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:26:16,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-20 06:26:16,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 579. [2024-11-20 06:26:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 501 states have (on average 1.4131736526946108) internal successors, (708), 504 states have internal predecessors, (708), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 06:26:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 836 transitions. [2024-11-20 06:26:16,492 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 836 transitions. Word has length 172 [2024-11-20 06:26:16,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:26:16,492 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 836 transitions. [2024-11-20 06:26:16,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:26:16,493 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 836 transitions. [2024-11-20 06:26:16,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 06:26:16,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:26:16,494 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:26:16,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 06:26:16,494 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:26:16,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:26:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash -157194738, now seen corresponding path program 1 times [2024-11-20 06:26:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:26:16,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87088674] [2024-11-20 06:26:16,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:16,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:26:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:26:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:26:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:26:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:26:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:26:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:26:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:26:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:26:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:26:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:26:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:26:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:26:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:26:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:26:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:26:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:26:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:26:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:26:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:26:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:26:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:26:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:26:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:26:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:26:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:26:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 06:26:17,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:26:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87088674] [2024-11-20 06:26:17,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87088674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:26:17,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:26:17,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:26:17,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017375573] [2024-11-20 06:26:17,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:26:17,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:26:17,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:26:17,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:26:17,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:26:17,965 INFO L87 Difference]: Start difference. First operand 579 states and 836 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:26:18,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:26:18,903 INFO L93 Difference]: Finished difference Result 1442 states and 2092 transitions. [2024-11-20 06:26:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:26:18,904 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2024-11-20 06:26:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:26:18,907 INFO L225 Difference]: With dead ends: 1442 [2024-11-20 06:26:18,907 INFO L226 Difference]: Without dead ends: 1089 [2024-11-20 06:26:18,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:26:18,909 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 369 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 06:26:18,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 472 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 06:26:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2024-11-20 06:26:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 577. [2024-11-20 06:26:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 499 states have (on average 1.4128256513026052) internal successors, (705), 502 states have internal predecessors, (705), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 06:26:18,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 833 transitions. [2024-11-20 06:26:18,937 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 833 transitions. Word has length 172 [2024-11-20 06:26:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:26:18,937 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 833 transitions. [2024-11-20 06:26:18,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:26:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 833 transitions. [2024-11-20 06:26:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 06:26:18,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:26:18,938 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:26:18,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 06:26:18,939 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:26:18,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:26:18,939 INFO L85 PathProgramCache]: Analyzing trace with hash 496607426, now seen corresponding path program 1 times [2024-11-20 06:26:18,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:26:18,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952588551] [2024-11-20 06:26:18,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:18,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:26:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:26:19,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396165260] [2024-11-20 06:26:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:19,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:26:19,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:26:19,041 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-20 06:26:19,043 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-20 06:26:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:19,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-20 06:26:19,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:26:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 602 proven. 159 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-20 06:26:21,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:26:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 96 proven. 111 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-11-20 06:26:24,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:26:24,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952588551] [2024-11-20 06:26:24,480 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 06:26:24,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396165260] [2024-11-20 06:26:24,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396165260] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:26:24,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 06:26:24,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2024-11-20 06:26:24,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370391347] [2024-11-20 06:26:24,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 06:26:24,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-20 06:26:24,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:26:24,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-20 06:26:24,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1177, Unknown=0, NotChecked=0, Total=1482 [2024-11-20 06:26:24,483 INFO L87 Difference]: Start difference. First operand 577 states and 833 transitions. Second operand has 39 states, 38 states have (on average 3.210526315789474) internal successors, (122), 37 states have internal predecessors, (122), 10 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) [2024-11-20 06:26:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:26:34,638 INFO L93 Difference]: Finished difference Result 2347 states and 3304 transitions. [2024-11-20 06:26:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-20 06:26:34,639 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.210526315789474) internal successors, (122), 37 states have internal predecessors, (122), 10 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) Word has length 173 [2024-11-20 06:26:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:26:34,653 INFO L225 Difference]: With dead ends: 2347 [2024-11-20 06:26:34,657 INFO L226 Difference]: Without dead ends: 1869 [2024-11-20 06:26:34,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3855 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2332, Invalid=9224, Unknown=0, NotChecked=0, Total=11556 [2024-11-20 06:26:34,667 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1910 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 3025 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1928 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 3530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 3025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-20 06:26:34,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1928 Valid, 1685 Invalid, 3530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 3025 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-20 06:26:34,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2024-11-20 06:26:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 768. [2024-11-20 06:26:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 682 states have (on average 1.401759530791789) internal successors, (956), 685 states have internal predecessors, (956), 64 states have call successors, (64), 21 states have call predecessors, (64), 21 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 06:26:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1084 transitions. [2024-11-20 06:26:34,779 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1084 transitions. Word has length 173 [2024-11-20 06:26:34,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:26:34,779 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1084 transitions. [2024-11-20 06:26:34,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.210526315789474) internal successors, (122), 37 states have internal predecessors, (122), 10 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) [2024-11-20 06:26:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1084 transitions. [2024-11-20 06:26:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 06:26:34,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:26:34,785 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:26:34,800 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-20 06:26:34,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:26:34,986 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:26:34,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:26:34,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1644732866, now seen corresponding path program 1 times [2024-11-20 06:26:34,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:26:34,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015615282] [2024-11-20 06:26:34,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:34,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:26:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:26:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:26:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:26:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:26:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:26:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:26:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:26:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:26:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:26:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:26:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:26:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:26:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:26:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:26:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:26:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:26:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:26:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:26:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:26:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:26:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:26:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:26:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:26:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:26:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:26:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-20 06:26:35,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:26:35,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015615282] [2024-11-20 06:26:35,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015615282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:26:35,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:26:35,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:26:35,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106512191] [2024-11-20 06:26:35,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:26:35,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:26:35,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:26:35,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:26:35,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:26:35,365 INFO L87 Difference]: Start difference. First operand 768 states and 1084 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:26:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:26:35,461 INFO L93 Difference]: Finished difference Result 1680 states and 2369 transitions. [2024-11-20 06:26:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:26:35,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 173 [2024-11-20 06:26:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:26:35,468 INFO L225 Difference]: With dead ends: 1680 [2024-11-20 06:26:35,468 INFO L226 Difference]: Without dead ends: 1234 [2024-11-20 06:26:35,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:26:35,470 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 75 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:26:35,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 269 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:26:35,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2024-11-20 06:26:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1222. [2024-11-20 06:26:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1086 states have (on average 1.3941068139963169) internal successors, (1514), 1092 states have internal predecessors, (1514), 103 states have call successors, (103), 32 states have call predecessors, (103), 32 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-20 06:26:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1720 transitions. [2024-11-20 06:26:35,549 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1720 transitions. Word has length 173 [2024-11-20 06:26:35,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:26:35,549 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1720 transitions. [2024-11-20 06:26:35,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-20 06:26:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1720 transitions. [2024-11-20 06:26:35,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 06:26:35,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:26:35,551 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:26:35,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 06:26:35,551 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:26:35,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:26:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash 964674496, now seen corresponding path program 1 times [2024-11-20 06:26:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:26:35,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582906109] [2024-11-20 06:26:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:35,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:26:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:26:35,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143777140] [2024-11-20 06:26:35,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:35,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:26:35,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:26:35,859 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-20 06:26:35,860 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-20 06:26:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:26:35,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:26:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:26:36,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:26:36,099 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:26:36,099 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:26:36,109 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-20 06:26:36,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-20 06:26:36,304 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:26:36,397 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:26:36,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:26:36 BoogieIcfgContainer [2024-11-20 06:26:36,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:26:36,401 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:26:36,401 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:26:36,401 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:26:36,402 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:25:28" (3/4) ... [2024-11-20 06:26:36,404 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:26:36,406 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:26:36,406 INFO L158 Benchmark]: Toolchain (without parser) took 69009.24ms. Allocated memory was 197.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 126.7MB in the beginning and 906.4MB in the end (delta: -779.7MB). Peak memory consumption was 345.1MB. Max. memory is 16.1GB. [2024-11-20 06:26:36,406 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:26:36,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.95ms. Allocated memory is still 197.1MB. Free memory was 126.7MB in the beginning and 106.9MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 06:26:36,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.44ms. Allocated memory is still 197.1MB. Free memory was 106.9MB in the beginning and 98.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-20 06:26:36,407 INFO L158 Benchmark]: Boogie Preprocessor took 99.77ms. Allocated memory is still 197.1MB. Free memory was 98.5MB in the beginning and 82.3MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 06:26:36,408 INFO L158 Benchmark]: RCFGBuilder took 683.96ms. Allocated memory is still 197.1MB. Free memory was 82.3MB in the beginning and 146.1MB in the end (delta: -63.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-20 06:26:36,408 INFO L158 Benchmark]: TraceAbstraction took 67748.16ms. Allocated memory was 197.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 146.1MB in the beginning and 907.4MB in the end (delta: -761.3MB). Peak memory consumption was 361.7MB. Max. memory is 16.1GB. [2024-11-20 06:26:36,408 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 1.3GB. Free memory was 907.4MB in the beginning and 906.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:26:36,409 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 121.6MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.95ms. Allocated memory is still 197.1MB. Free memory was 126.7MB in the beginning and 106.9MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.44ms. Allocated memory is still 197.1MB. Free memory was 106.9MB in the beginning and 98.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.77ms. Allocated memory is still 197.1MB. Free memory was 98.5MB in the beginning and 82.3MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 683.96ms. Allocated memory is still 197.1MB. Free memory was 82.3MB in the beginning and 146.1MB in the end (delta: -63.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 67748.16ms. Allocated memory was 197.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 146.1MB in the beginning and 907.4MB in the end (delta: -761.3MB). Peak memory consumption was 361.7MB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 1.3GB. Free memory was 907.4MB in the beginning and 906.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 193, overapproximation of someUnaryDOUBLEoperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryArithmeticFLOAToperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -100; [L23] unsigned char var_1_2 = 200; [L24] unsigned char var_1_3 = 100; [L25] unsigned char var_1_4 = 8; [L26] unsigned char var_1_7 = 16; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 0; [L33] unsigned short int var_1_17 = 256; [L34] signed short int var_1_19 = -100; [L35] signed short int var_1_20 = 32; [L36] unsigned char var_1_21 = 1; [L37] signed short int var_1_23 = -256; [L38] float var_1_24 = -0.5; [L39] float var_1_25 = 255.8; [L40] float var_1_26 = 31.2; [L41] float var_1_27 = 0.5; [L42] unsigned char var_1_28 = 32; [L43] unsigned char var_1_29 = 64; [L44] unsigned short int var_1_30 = 16; [L45] double var_1_31 = 255.9; [L46] unsigned short int var_1_33 = 39141; [L47] unsigned short int var_1_34 = 52589; [L48] signed long int last_1_var_1_1 = -100; [L49] unsigned char last_1_var_1_7 = 16; [L50] unsigned short int last_1_var_1_17 = 256; [L51] signed short int last_1_var_1_19 = -100; [L52] signed short int last_1_var_1_20 = 32; [L53] signed short int last_1_var_1_23 = -256; [L54] unsigned char last_1_var_1_28 = 32; VAL [isInitial=0, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=200, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_7 = var_1_7 [L186] last_1_var_1_17 = var_1_17 [L187] last_1_var_1_19 = var_1_19 [L188] last_1_var_1_20 = var_1_20 [L189] last_1_var_1_23 = var_1_23 [L190] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=200, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L143] var_1_2 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L144] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L145] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L146] var_1_3 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_3 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L147] RET assume_abort_if_not(var_1_3 >= 63) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L148] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L149] var_1_4 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L150] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L151] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L152] var_1_12 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L154] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L157] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L158] var_1_15 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L159] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L160] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L161] var_1_16 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L162] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L163] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L164] var_1_25 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L165] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L166] var_1_26 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L167] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L168] var_1_27 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L169] RET assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L170] var_1_29 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_29 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L171] RET assume_abort_if_not(var_1_29 >= 64) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L172] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L173] var_1_31 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L174] RET assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L175] CALL assume_abort_if_not(var_1_31 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L175] RET assume_abort_if_not(var_1_31 != 0.0F) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L176] var_1_33 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L177] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L178] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L178] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L179] var_1_34 = __VERIFIER_nondet_ushort() [L180] CALL assume_abort_if_not(var_1_34 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L180] RET assume_abort_if_not(var_1_34 >= 32767) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L181] CALL assume_abort_if_not(var_1_34 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L181] RET assume_abort_if_not(var_1_34 <= 65534) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L201] RET updateVariables() [L202] CALL step() [L58] COND FALSE !((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) [L67] var_1_1 = var_1_2 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L69] unsigned char stepLocal_1 = last_1_var_1_28 < (var_1_3 - var_1_4); [L70] signed long int stepLocal_0 = last_1_var_1_28; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_0=32, stepLocal_1=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L71] COND TRUE stepLocal_1 || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_0=32, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L72] COND TRUE stepLocal_0 >= var_1_4 [L73] var_1_7 = 2 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L80] unsigned char stepLocal_3 = var_1_4; [L81] signed long int stepLocal_2 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_2=256, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L82] COND FALSE !(stepLocal_2 < ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) [L89] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L91] var_1_24 = (var_1_25 + ((((var_1_26) < (var_1_27)) ? (var_1_26) : (var_1_27)))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L92] COND TRUE ! var_1_12 [L93] var_1_28 = ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_29) - var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L97] COND TRUE (var_1_24 / var_1_31) > var_1_24 [L98] var_1_30 = (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L100] var_1_19 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_28)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_28))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L101] EXPR var_1_4 ^ var_1_1 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L101] COND FALSE !(var_1_1 != (var_1_4 ^ var_1_1)) [L110] unsigned char stepLocal_6 = var_1_9; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_6=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L111] COND TRUE stepLocal_6 || (var_1_28 >= last_1_var_1_20) [L112] var_1_20 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) + var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L116] unsigned char stepLocal_8 = var_1_28 > var_1_7; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_8=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L117] COND TRUE stepLocal_8 || var_1_14 [L118] var_1_23 = (((((var_1_3 + (var_1_2 - var_1_28))) < (var_1_4)) ? ((var_1_3 + (var_1_2 - var_1_28))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L122] unsigned char stepLocal_7 = ((((var_1_23) > (var_1_19)) ? (var_1_23) : (var_1_19))) <= 0; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_7=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L123] COND FALSE !(stepLocal_7 && var_1_13) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L128] signed short int stepLocal_5 = var_1_23; [L129] unsigned char stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, stepLocal_5=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L130] COND FALSE !((var_1_28 / (2571661009u - var_1_2)) != stepLocal_5) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L135] COND TRUE \read(var_1_21) [L136] var_1_17 = var_1_7 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L202] RET step() [L203] CALL, EXPR property() [L193] EXPR ((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193] EXPR var_1_4 ^ var_1_1 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193] EXPR ((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193-L194] return (((((((((((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1)) && ((last_1_var_1_17 < ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) ? ((var_1_4 >= last_1_var_1_19) ? (var_1_14 == ((unsigned char) var_1_12)) : (var_1_14 == ((unsigned char) (var_1_15 && var_1_16)))) : (var_1_14 == ((unsigned char) var_1_15)))) && (((var_1_28 / (2571661009u - var_1_2)) != var_1_23) ? ((var_1_12 && var_1_21) ? (var_1_17 == ((unsigned short int) 2)) : 1) : (var_1_21 ? (var_1_17 == ((unsigned short int) var_1_7)) : (var_1_17 == ((unsigned short int) var_1_2))))) && (var_1_19 == ((signed short int) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_28)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_28)))))) && ((var_1_9 || (var_1_28 >= last_1_var_1_20)) ? (var_1_20 == ((signed short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) + var_1_4))) : (var_1_20 == ((signed short int) (var_1_4 - (((((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3))) < 0 ) ? -((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3))) : ((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3)))))))))) && (((((((var_1_23) > (var_1_19)) ? (var_1_23) : (var_1_19))) <= 0) && var_1_13) ? (var_1_14 ? (var_1_21 == ((unsigned char) var_1_16)) : 1) : 1)) && (((var_1_28 > var_1_7) || var_1_14) ? (var_1_23 == ((signed short int) (((((var_1_3 + (var_1_2 - var_1_28))) < (var_1_4)) ? ((var_1_3 + (var_1_2 - var_1_28))) : (var_1_4))))) : (var_1_23 == ((signed short int) (var_1_2 - var_1_28))))) && (var_1_24 == ((float) (var_1_25 + ((((var_1_26) < (var_1_27)) ? (var_1_26) : (var_1_27))))))) && ((! var_1_12) ? (var_1_28 == ((unsigned char) ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_29) - var_1_4))) : (var_1_28 == ((unsigned char) ((((((((var_1_29) < (var_1_4)) ? (var_1_29) : (var_1_4)))) > (var_1_3)) ? (((((var_1_29) < (var_1_4)) ? (var_1_29) : (var_1_4)))) : (var_1_3))))))) && (((var_1_24 / var_1_31) > var_1_24) ? (var_1_30 == ((unsigned short int) (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - var_1_4))) : 1) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.6s, OverallIterations: 17, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 31.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9825 SdHoareTripleChecker+Valid, 18.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9767 mSDsluCounter, 11809 SdHoareTripleChecker+Invalid, 16.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9594 mSDsCounter, 1625 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12370 IncrementalHoareTripleChecker+Invalid, 13995 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1625 mSolverCounterUnsat, 2215 mSDtfsCounter, 12370 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2196 GetRequests, 1815 SyntacticMatches, 2 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6947 ImplicationChecksByTransitivity, 17.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1222occurred in iteration=16, InterpolantAutomatonStates: 300, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 5858 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 32.0s InterpolantComputationTime, 3602 NumberOfCodeBlocks, 3602 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3579 ConstructedInterpolants, 0 QuantifiedInterpolants, 38896 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1256 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 24546/25200 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-20 06:26:36,625 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-20 06:26:36,670 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.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 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:26:38,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:26:38,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:26:38,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:26:38,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:26:38,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:26:38,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:26:38,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:26:38,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:26:38,691 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:26:38,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:26:38,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:26:38,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:26:38,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:26:38,692 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:26:38,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:26:38,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:26:38,693 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:26:38,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:26:38,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:26:38,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:26:38,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:26:38,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:26:38,696 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:26:38,696 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:26:38,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:26:38,696 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:26:38,696 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:26:38,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:26:38,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:26:38,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:26:38,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:26:38,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:26:38,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:26:38,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:26:38,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:26:38,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:26:38,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:26:38,698 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:26:38,698 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:26:38,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:26:38,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:26:38,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:26:38,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:26:38,700 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 -> 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 [2024-11-20 06:26:38,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:26:39,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:26:39,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:26:39,038 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:26:39,038 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:26:39,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-20 06:26:40,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:26:40,615 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:26:40,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-20 06:26:40,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3be0917/ea92d46575ad4399815fa703d584a7fc/FLAGc8317b0c7 [2024-11-20 06:26:40,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3be0917/ea92d46575ad4399815fa703d584a7fc [2024-11-20 06:26:40,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:26:40,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:26:40,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:26:40,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:26:40,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:26:40,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:26:40" (1/1) ... [2024-11-20 06:26:40,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f671f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:40, skipping insertion in model container [2024-11-20 06:26:40,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:26:40" (1/1) ... [2024-11-20 06:26:41,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:26:41,184 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_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-20 06:26:41,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:26:41,277 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:26:41,290 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_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-20 06:26:41,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:26:41,350 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:26:41,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:41 WrapperNode [2024-11-20 06:26:41,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:26:41,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:26:41,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:26:41,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:26:41,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:41" (1/1) ... [2024-11-20 06:26:41,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:41" (1/1) ... [2024-11-20 06:26:41,421 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2024-11-20 06:26:41,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:26:41,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:26:41,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:26:41,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:26:41,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:41" (1/1) ... [2024-11-20 06:26:41,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:41" (1/1) ... [2024-11-20 06:26:41,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:41" (1/1) ... [2024-11-20 06:26:41,458 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-20 06:26:41,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:41" (1/1) ... [2024-11-20 06:26:41,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:41" (1/1) ... [2024-11-20 06:26:41,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:41" (1/1) ... [2024-11-20 06:26:41,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:41" (1/1) ... [2024-11-20 06:26:41,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:41" (1/1) ... [2024-11-20 06:26:41,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:41" (1/1) ... [2024-11-20 06:26:41,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:26:41,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:26:41,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:26:41,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:26:41,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:41" (1/1) ... [2024-11-20 06:26:41,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:26:41,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:26:41,529 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-20 06:26:41,538 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-20 06:26:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:26:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:26:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:26:41,574 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:26:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:26:41,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:26:41,644 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:26:41,646 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation