./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-1loop_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-1loop_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 e5900adef742c9bfa7a4740bfd6257cd40ef26644b367767fd6845fd72b79bbd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:14:10,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:14:10,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:14:10,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:14:10,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:14:10,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:14:10,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:14:10,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:14:10,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:14:10,153 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:14:10,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:14:10,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:14:10,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:14:10,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:14:10,156 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:14:10,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:14:10,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:14:10,157 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:14:10,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:14:10,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:14:10,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:14:10,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:14:10,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:14:10,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:14:10,161 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:14:10,161 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:14:10,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:14:10,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:14:10,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:14:10,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:14:10,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:14:10,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:14:10,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:14:10,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:14:10,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:14:10,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:14:10,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:14:10,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:14:10,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:14:10,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:14:10,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:14:10,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:14:10,186 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 -> e5900adef742c9bfa7a4740bfd6257cd40ef26644b367767fd6845fd72b79bbd [2024-11-20 06:14:10,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:14:10,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:14:10,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:14:10,444 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:14:10,449 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:14:10,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-53.i [2024-11-20 06:14:11,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:14:12,016 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:14:12,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-53.i [2024-11-20 06:14:12,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca9db3ef/e4ea2889db824ec8bb4d22172cb19d0c/FLAG6a5fb2998 [2024-11-20 06:14:12,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca9db3ef/e4ea2889db824ec8bb4d22172cb19d0c [2024-11-20 06:14:12,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:14:12,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:14:12,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:14:12,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:14:12,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:14:12,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:14:12" (1/1) ... [2024-11-20 06:14:12,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2690e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:12, skipping insertion in model container [2024-11-20 06:14:12,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:14:12" (1/1) ... [2024-11-20 06:14:12,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:14:12,720 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-1loop_file-53.i[916,929] [2024-11-20 06:14:12,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:14:12,836 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:14:12,845 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-1loop_file-53.i[916,929] [2024-11-20 06:14:12,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:14:12,898 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:14:12,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:12 WrapperNode [2024-11-20 06:14:12,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:14:12,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:14:12,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:14:12,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:14:12,909 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:14:12" (1/1) ... [2024-11-20 06:14:12,920 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:14:12" (1/1) ... [2024-11-20 06:14:12,975 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225 [2024-11-20 06:14:12,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:14:12,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:14:12,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:14:12,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:14:12,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:12" (1/1) ... [2024-11-20 06:14:12,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:12" (1/1) ... [2024-11-20 06:14:12,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:12" (1/1) ... [2024-11-20 06:14:13,028 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:14:13,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:12" (1/1) ... [2024-11-20 06:14:13,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:12" (1/1) ... [2024-11-20 06:14:13,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:12" (1/1) ... [2024-11-20 06:14:13,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:12" (1/1) ... [2024-11-20 06:14:13,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:12" (1/1) ... [2024-11-20 06:14:13,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:12" (1/1) ... [2024-11-20 06:14:13,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:14:13,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:14:13,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:14:13,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:14:13,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:12" (1/1) ... [2024-11-20 06:14:13,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:14:13,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:14:13,111 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:14:13,116 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:14:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:14:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:14:13,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:14:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:14:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:14:13,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:14:13,227 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:14:13,229 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:14:13,727 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-20 06:14:13,728 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:14:13,740 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:14:13,740 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:14:13,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:14:13 BoogieIcfgContainer [2024-11-20 06:14:13,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:14:13,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:14:13,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:14:13,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:14:13,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:14:12" (1/3) ... [2024-11-20 06:14:13,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efbd4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:14:13, skipping insertion in model container [2024-11-20 06:14:13,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:12" (2/3) ... [2024-11-20 06:14:13,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efbd4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:14:13, skipping insertion in model container [2024-11-20 06:14:13,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:14:13" (3/3) ... [2024-11-20 06:14:13,755 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-53.i [2024-11-20 06:14:13,774 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:14:13,774 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:14:13,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:14:13,823 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;@71552077, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:14:13,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:14:13,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 70 states have internal predecessors, (100), 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:14:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 06:14:13,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:14:13,841 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:14:13,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:14:13,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:14:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1399656776, now seen corresponding path program 1 times [2024-11-20 06:14:13,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:14:13,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863442255] [2024-11-20 06:14:13,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:13,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:14:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:14:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:14:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:14:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:14:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:14:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:14:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:14:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:14:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:14:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:14:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:14:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:14:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:14:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:14:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:14:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:14:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:14:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:14:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:14:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:14:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:14:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:14:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:14:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:14:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:14:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:14,373 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:14:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:14:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863442255] [2024-11-20 06:14:14,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863442255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:14:14,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:14:14,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:14:14,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081174845] [2024-11-20 06:14:14,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:14:14,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:14:14,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:14:14,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:14:14,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:14:14,405 INFO L87 Difference]: Start difference. First operand has 97 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 70 states have internal predecessors, (100), 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:14:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:14:14,432 INFO L93 Difference]: Finished difference Result 191 states and 322 transitions. [2024-11-20 06:14:14,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:14:14,436 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:14:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:14:14,444 INFO L225 Difference]: With dead ends: 191 [2024-11-20 06:14:14,444 INFO L226 Difference]: Without dead ends: 93 [2024-11-20 06:14:14,447 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:14:14,451 INFO L432 NwaCegarLoop]: 147 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, 147 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:14:14,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:14:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-20 06:14:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-20 06:14:14,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 66 states have internal predecessors, (93), 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:14:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2024-11-20 06:14:14,490 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 170 [2024-11-20 06:14:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:14:14,491 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2024-11-20 06:14:14,491 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:14:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2024-11-20 06:14:14,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 06:14:14,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:14:14,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] [2024-11-20 06:14:14,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:14:14,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:14:14,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:14:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1897820338, now seen corresponding path program 1 times [2024-11-20 06:14:14,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:14:14,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547284950] [2024-11-20 06:14:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:14,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:14:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:14:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:14:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:14:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:14:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:14:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:14:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:14:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:14:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:14:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:14:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:14:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:14:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:14:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:14:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:14:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:14:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:14:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:14:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:14:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:14:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:14:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:14:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:14:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:14:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:14:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:15,210 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:14:15,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:14:15,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547284950] [2024-11-20 06:14:15,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547284950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:14:15,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:14:15,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:14:15,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987085673] [2024-11-20 06:14:15,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:14:15,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:14:15,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:14:15,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:14:15,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:14:15,216 INFO L87 Difference]: Start difference. First operand 93 states and 143 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:14:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:14:15,318 INFO L93 Difference]: Finished difference Result 233 states and 356 transitions. [2024-11-20 06:14:15,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:14:15,319 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:14:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:14:15,321 INFO L225 Difference]: With dead ends: 233 [2024-11-20 06:14:15,321 INFO L226 Difference]: Without dead ends: 143 [2024-11-20 06:14:15,322 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:14:15,326 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 65 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 405 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.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:14:15,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 405 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:14:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-20 06:14:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2024-11-20 06:14:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 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:14:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 212 transitions. [2024-11-20 06:14:15,350 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 212 transitions. Word has length 170 [2024-11-20 06:14:15,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:14:15,350 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 212 transitions. [2024-11-20 06:14:15,351 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:14:15,351 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 212 transitions. [2024-11-20 06:14:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 06:14:15,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:14:15,353 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:14:15,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:14:15,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:14:15,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:14:15,357 INFO L85 PathProgramCache]: Analyzing trace with hash -622139596, now seen corresponding path program 1 times [2024-11-20 06:14:15,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:14:15,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530121908] [2024-11-20 06:14:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:15,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:14:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:14:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:14:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:14:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:14:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:14:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:14:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:14:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:14:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:14:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:14:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:14:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:14:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:14:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:14:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:14:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:14:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:14:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:14:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:14:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:14:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:14:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:14:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:14:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:14:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:14:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:20,229 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:14:20,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:14:20,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530121908] [2024-11-20 06:14:20,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530121908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:14:20,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:14:20,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 06:14:20,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530353999] [2024-11-20 06:14:20,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:14:20,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 06:14:20,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:14:20,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 06:14:20,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:14:20,235 INFO L87 Difference]: Start difference. First operand 139 states and 212 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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:14:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:14:23,093 INFO L93 Difference]: Finished difference Result 602 states and 917 transitions. [2024-11-20 06:14:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 06:14:23,093 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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:14:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:14:23,098 INFO L225 Difference]: With dead ends: 602 [2024-11-20 06:14:23,099 INFO L226 Difference]: Without dead ends: 466 [2024-11-20 06:14:23,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2024-11-20 06:14:23,102 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 568 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:14:23,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 734 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-20 06:14:23,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-20 06:14:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 242. [2024-11-20 06:14:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 181 states have (on average 1.4364640883977902) internal successors, (260), 182 states have internal predecessors, (260), 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:14:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 372 transitions. [2024-11-20 06:14:23,148 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 372 transitions. Word has length 170 [2024-11-20 06:14:23,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:14:23,149 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 372 transitions. [2024-11-20 06:14:23,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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:14:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 372 transitions. [2024-11-20 06:14:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 06:14:23,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:14:23,160 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:14:23,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:14:23,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:14:23,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:14:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2070601, now seen corresponding path program 1 times [2024-11-20 06:14:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:14:23,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594680899] [2024-11-20 06:14:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:14:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:14:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:14:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:14:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:14:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:14:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:14:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:14:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:14:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:14:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:14:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:14:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:14:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:14:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:14:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:14:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:14:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:14:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:14:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:14:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:14:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:14:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:14:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:14:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:14:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:14:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,303 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:14:23,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:14:23,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594680899] [2024-11-20 06:14:23,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594680899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:14:23,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:14:23,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:14:23,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302589748] [2024-11-20 06:14:23,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:14:23,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:14:23,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:14:23,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:14:23,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:14:23,305 INFO L87 Difference]: Start difference. First operand 242 states and 372 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:14:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:14:23,407 INFO L93 Difference]: Finished difference Result 574 states and 881 transitions. [2024-11-20 06:14:23,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 06:14:23,408 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:14:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:14:23,410 INFO L225 Difference]: With dead ends: 574 [2024-11-20 06:14:23,411 INFO L226 Difference]: Without dead ends: 438 [2024-11-20 06:14:23,411 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:14:23,412 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 140 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 420 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:14:23,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 420 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:14:23,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-20 06:14:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 357. [2024-11-20 06:14:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 285 states have (on average 1.4421052631578948) internal successors, (411), 288 states have internal predecessors, (411), 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:14:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 539 transitions. [2024-11-20 06:14:23,432 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 539 transitions. Word has length 171 [2024-11-20 06:14:23,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:14:23,432 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 539 transitions. [2024-11-20 06:14:23,433 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:14:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 539 transitions. [2024-11-20 06:14:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 06:14:23,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:14:23,434 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:14:23,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:14:23,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:14:23,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:14:23,435 INFO L85 PathProgramCache]: Analyzing trace with hash 136084107, now seen corresponding path program 1 times [2024-11-20 06:14:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:14:23,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780414811] [2024-11-20 06:14:23,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:23,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:14:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:14:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:14:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:23,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:14:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:14:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:14:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:14:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:14:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:14:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:14:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:14:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:14:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:14:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:14:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:14:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:14:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:14:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:14:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:14:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:14:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:14:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:14:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:14:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:14:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:14:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:14:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:24,060 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:14:24,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:14:24,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780414811] [2024-11-20 06:14:24,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780414811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:14:24,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:14:24,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 06:14:24,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240883009] [2024-11-20 06:14:24,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:14:24,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:14:24,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:14:24,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:14:24,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:14:24,062 INFO L87 Difference]: Start difference. First operand 357 states and 539 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:14:24,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:14:24,705 INFO L93 Difference]: Finished difference Result 1052 states and 1576 transitions. [2024-11-20 06:14:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 06:14:24,705 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:14:24,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:14:24,709 INFO L225 Difference]: With dead ends: 1052 [2024-11-20 06:14:24,710 INFO L226 Difference]: Without dead ends: 837 [2024-11-20 06:14:24,711 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:14:24,711 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 336 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 06:14:24,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1138 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 06:14:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-11-20 06:14:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 405. [2024-11-20 06:14:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 333 states have (on average 1.4654654654654655) internal successors, (488), 336 states have internal predecessors, (488), 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:14:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 616 transitions. [2024-11-20 06:14:24,744 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 616 transitions. Word has length 171 [2024-11-20 06:14:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:14:24,746 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 616 transitions. [2024-11-20 06:14:24,746 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:14:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 616 transitions. [2024-11-20 06:14:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 06:14:24,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:14:24,748 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:14:24,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 06:14:24,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:14:24,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:14:24,748 INFO L85 PathProgramCache]: Analyzing trace with hash -122081331, now seen corresponding path program 1 times [2024-11-20 06:14:24,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:14:24,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409707629] [2024-11-20 06:14:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:24,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:14:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:14:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:14:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:14:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:14:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:14:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:14:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:14:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:14:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:14:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:14:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:14:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:14:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:14:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:14:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:14:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:14:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:14:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:14:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:14:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:14:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:14:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:14:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:14:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:14:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:14:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:26,607 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:14:26,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:14:26,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409707629] [2024-11-20 06:14:26,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409707629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:14:26,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:14:26,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 06:14:26,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181826707] [2024-11-20 06:14:26,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:14:26,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:14:26,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:14:26,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:14:26,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:14:26,609 INFO L87 Difference]: Start difference. First operand 405 states and 616 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:14:27,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:14:27,889 INFO L93 Difference]: Finished difference Result 1006 states and 1518 transitions. [2024-11-20 06:14:27,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 06:14:27,891 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:14:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:14:27,895 INFO L225 Difference]: With dead ends: 1006 [2024-11-20 06:14:27,895 INFO L226 Difference]: Without dead ends: 791 [2024-11-20 06:14:27,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:14:27,899 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 204 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:14:27,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 855 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 06:14:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-20 06:14:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 445. [2024-11-20 06:14:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 373 states have (on average 1.482573726541555) internal successors, (553), 376 states have internal predecessors, (553), 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:14:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 681 transitions. [2024-11-20 06:14:27,928 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 681 transitions. Word has length 171 [2024-11-20 06:14:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:14:27,928 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 681 transitions. [2024-11-20 06:14:27,929 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:14:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 681 transitions. [2024-11-20 06:14:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 06:14:27,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:14:27,931 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:14:27,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 06:14:27,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:14:27,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:14:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1004917690, now seen corresponding path program 1 times [2024-11-20 06:14:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:14:27,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543944758] [2024-11-20 06:14:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:14:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:14:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:14:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:14:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:14:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:14:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:14:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:14:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:14:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:14:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:14:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:14:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:14:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:14:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:14:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:14:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:14:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:32,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:14:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:32,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:14:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:32,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:14:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:32,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:14:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:32,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:14:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:32,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:14:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:32,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:14:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:32,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:14:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:14:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:32,213 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:14:32,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:14:32,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543944758] [2024-11-20 06:14:32,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543944758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:14:32,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:14:32,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 06:14:32,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321687142] [2024-11-20 06:14:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:14:32,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 06:14:32,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:14:32,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 06:14:32,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-20 06:14:32,216 INFO L87 Difference]: Start difference. First operand 445 states and 681 transitions. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-20 06:14:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:14:35,602 INFO L93 Difference]: Finished difference Result 1554 states and 2350 transitions. [2024-11-20 06:14:35,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 06:14:35,603 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 171 [2024-11-20 06:14:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:14:35,607 INFO L225 Difference]: With dead ends: 1554 [2024-11-20 06:14:35,608 INFO L226 Difference]: Without dead ends: 1293 [2024-11-20 06:14:35,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2024-11-20 06:14:35,609 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 953 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:14:35,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 1048 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-20 06:14:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2024-11-20 06:14:35,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 492. [2024-11-20 06:14:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 420 states have (on average 1.5047619047619047) internal successors, (632), 423 states have internal predecessors, (632), 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:14:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 760 transitions. [2024-11-20 06:14:35,634 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 760 transitions. Word has length 171 [2024-11-20 06:14:35,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:14:35,636 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 760 transitions. [2024-11-20 06:14:35,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-20 06:14:35,636 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 760 transitions. [2024-11-20 06:14:35,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 06:14:35,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:14:35,638 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:14:35,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 06:14:35,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:14:35,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:14:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash 746752252, now seen corresponding path program 1 times [2024-11-20 06:14:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:14:35,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395352586] [2024-11-20 06:14:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:35,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:14:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:14:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:14:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:14:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:14:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:14:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:14:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:14:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:14:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:14:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:14:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:14:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:14:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:14:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:14:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:14:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:14:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:14:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:14:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:14:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:14:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:14:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:14:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:14:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:14:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:14:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:37,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:14:37,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:14:37,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395352586] [2024-11-20 06:14:37,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395352586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:14:37,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:14:37,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 06:14:37,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833316413] [2024-11-20 06:14:37,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:14:37,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 06:14:37,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:14:37,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 06:14:37,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:14:37,364 INFO L87 Difference]: Start difference. First operand 492 states and 760 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:14:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:14:39,015 INFO L93 Difference]: Finished difference Result 1196 states and 1819 transitions. [2024-11-20 06:14:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 06:14:39,015 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:14:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:14:39,019 INFO L225 Difference]: With dead ends: 1196 [2024-11-20 06:14:39,019 INFO L226 Difference]: Without dead ends: 935 [2024-11-20 06:14:39,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-20 06:14:39,020 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 421 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:14:39,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 588 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 06:14:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-11-20 06:14:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 447. [2024-11-20 06:14:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 375 states have (on average 1.4826666666666666) internal successors, (556), 378 states have internal predecessors, (556), 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:14:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 684 transitions. [2024-11-20 06:14:39,041 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 684 transitions. Word has length 171 [2024-11-20 06:14:39,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:14:39,041 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 684 transitions. [2024-11-20 06:14:39,042 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:14:39,042 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 684 transitions. [2024-11-20 06:14:39,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 06:14:39,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:14:39,043 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:14:39,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 06:14:39,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:14:39,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:14:39,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1995543665, now seen corresponding path program 1 times [2024-11-20 06:14:39,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:14:39,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988345762] [2024-11-20 06:14:39,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:39,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:14:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:14:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:14:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:14:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:14:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:14:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:14:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:14:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:14:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:14:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:14:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:14:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:14:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:14:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:14:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:14:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:14:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:14:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:14:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:14:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:14:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:14:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:14:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:14:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:14:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:14:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:39,918 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:14:39,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:14:39,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988345762] [2024-11-20 06:14:39,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988345762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:14:39,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531732827] [2024-11-20 06:14:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:39,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:14:39,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:14:39,921 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:14:39,922 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:14:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:40,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 06:14:40,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:14:40,292 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:14:40,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:14:40,556 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:14:40,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531732827] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:14:40,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:14:40,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 21 [2024-11-20 06:14:40,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797222259] [2024-11-20 06:14:40,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:14:40,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-20 06:14:40,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:14:40,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-20 06:14:40,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-20 06:14:40,559 INFO L87 Difference]: Start difference. First operand 447 states and 684 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:14:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:14:43,554 INFO L93 Difference]: Finished difference Result 2294 states and 3353 transitions. [2024-11-20 06:14:43,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-20 06:14:43,555 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:14:43,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:14:43,570 INFO L225 Difference]: With dead ends: 2294 [2024-11-20 06:14:43,570 INFO L226 Difference]: Without dead ends: 1953 [2024-11-20 06:14:43,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 389 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1979 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=983, Invalid=5659, Unknown=0, NotChecked=0, Total=6642 [2024-11-20 06:14:43,575 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1957 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 2019 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1969 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 2019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 06:14:43,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1969 Valid, 1662 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 2019 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 06:14:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2024-11-20 06:14:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 610. [2024-11-20 06:14:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 533 states have (on average 1.4371482176360224) internal successors, (766), 536 states have internal predecessors, (766), 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:14:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 894 transitions. [2024-11-20 06:14:43,613 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 894 transitions. Word has length 172 [2024-11-20 06:14:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:14:43,613 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 894 transitions. [2024-11-20 06:14:43,613 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:14:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 894 transitions. [2024-11-20 06:14:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 06:14:43,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:14:43,617 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:14:43,626 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:14:43,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:14:43,819 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:14:43,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:14:43,819 INFO L85 PathProgramCache]: Analyzing trace with hash -984426415, now seen corresponding path program 1 times [2024-11-20 06:14:43,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:14:43,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772436853] [2024-11-20 06:14:43,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:43,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:14:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:14:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:14:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:14:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:14:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:14:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:14:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:14:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:14:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:14:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:14:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:14:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:14:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:14:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:14:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:14:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:14:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:14:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:14:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:14:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:14:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:14:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:14:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:14:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:14:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:14:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,423 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:14:44,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:14:44,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772436853] [2024-11-20 06:14:44,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772436853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:14:44,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150050034] [2024-11-20 06:14:44,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:44,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:14:44,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:14:44,425 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:14:44,427 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:14:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:44,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 06:14:44,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:14:45,120 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:14:45,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:14:45,480 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:14:45,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150050034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:14:45,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:14:45,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2024-11-20 06:14:45,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002352261] [2024-11-20 06:14:45,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:14:45,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-20 06:14:45,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:14:45,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-20 06:14:45,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-20 06:14:45,483 INFO L87 Difference]: Start difference. First operand 610 states and 894 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:14:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:14:46,655 INFO L93 Difference]: Finished difference Result 1374 states and 1983 transitions. [2024-11-20 06:14:46,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-20 06:14:46,656 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:14:46,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:14:46,660 INFO L225 Difference]: With dead ends: 1374 [2024-11-20 06:14:46,660 INFO L226 Difference]: Without dead ends: 983 [2024-11-20 06:14:46,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2024-11-20 06:14:46,662 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 949 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 06:14:46,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 867 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 06:14:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-11-20 06:14:46,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 571. [2024-11-20 06:14:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 494 states have (on average 1.4190283400809716) internal successors, (701), 497 states have internal predecessors, (701), 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:14:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 829 transitions. [2024-11-20 06:14:46,692 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 829 transitions. Word has length 172 [2024-11-20 06:14:46,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:14:46,693 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 829 transitions. [2024-11-20 06:14:46,693 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:14:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 829 transitions. [2024-11-20 06:14:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 06:14:46,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:14:46,696 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:14:46,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 06:14:46,896 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,SelfDestructingSolverStorable9 [2024-11-20 06:14:46,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:14:46,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:14:46,898 INFO L85 PathProgramCache]: Analyzing trace with hash -247518493, now seen corresponding path program 1 times [2024-11-20 06:14:46,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:14:46,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599517505] [2024-11-20 06:14:46,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:46,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:14:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:14:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:14:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:14:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:14:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:14:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:14:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:14:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:14:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:14:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:14:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:14:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:14:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:14:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:14:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:14:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:14:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:14:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:14:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:14:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:14:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:14:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:14:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:14:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:14:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:14:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:47,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:14:47,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:14:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599517505] [2024-11-20 06:14:47,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599517505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:14:47,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:14:47,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:14:47,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105567447] [2024-11-20 06:14:47,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:14:47,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:14:47,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:14:47,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:14:47,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:14:47,110 INFO L87 Difference]: Start difference. First operand 571 states and 829 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:14:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:14:47,207 INFO L93 Difference]: Finished difference Result 986 states and 1434 transitions. [2024-11-20 06:14:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:14:47,208 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:14:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:14:47,210 INFO L225 Difference]: With dead ends: 986 [2024-11-20 06:14:47,210 INFO L226 Difference]: Without dead ends: 585 [2024-11-20 06:14:47,211 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:14:47,212 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 60 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:14:47,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 293 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:14:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-20 06:14:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 579. [2024-11-20 06:14:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 502 states have (on average 1.4123505976095618) internal successors, (709), 505 states have internal predecessors, (709), 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:14:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 837 transitions. [2024-11-20 06:14:47,237 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 837 transitions. Word has length 172 [2024-11-20 06:14:47,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:14:47,237 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 837 transitions. [2024-11-20 06:14:47,238 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:14:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 837 transitions. [2024-11-20 06:14:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 06:14:47,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:14:47,240 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:14:47,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 06:14:47,240 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:14:47,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:14:47,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1222913017, now seen corresponding path program 1 times [2024-11-20 06:14:47,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:14:47,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121226030] [2024-11-20 06:14:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:47,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:14:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:14:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:14:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:14:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:14:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:14:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:14:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:14:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:14:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:14:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:14:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:14:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:14:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:14:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:14:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:14:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:14:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:14:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:14:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:14:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:14:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:14:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:14:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:14:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:14:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:14:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:48,751 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:14:48,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:14:48,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121226030] [2024-11-20 06:14:48,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121226030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:14:48,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:14:48,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:14:48,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976539532] [2024-11-20 06:14:48,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:14:48,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:14:48,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:14:48,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:14:48,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:14:48,752 INFO L87 Difference]: Start difference. First operand 579 states and 837 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:14:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:14:49,712 INFO L93 Difference]: Finished difference Result 1458 states and 2109 transitions. [2024-11-20 06:14:49,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:14:49,713 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:14:49,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:14:49,717 INFO L225 Difference]: With dead ends: 1458 [2024-11-20 06:14:49,717 INFO L226 Difference]: Without dead ends: 1101 [2024-11-20 06:14:49,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:14:49,718 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 343 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 06:14:49,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 489 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 06:14:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2024-11-20 06:14:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 577. [2024-11-20 06:14:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 500 states have (on average 1.412) internal successors, (706), 503 states have internal predecessors, (706), 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:14:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 834 transitions. [2024-11-20 06:14:49,747 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 834 transitions. Word has length 172 [2024-11-20 06:14:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:14:49,748 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 834 transitions. [2024-11-20 06:14:49,749 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:14:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 834 transitions. [2024-11-20 06:14:49,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 06:14:49,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:14:49,750 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:14:49,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 06:14:49,750 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:14:49,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:14:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1805037936, now seen corresponding path program 1 times [2024-11-20 06:14:49,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:14:49,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596603750] [2024-11-20 06:14:49,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:49,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:14:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:14:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:14:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:14:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:14:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:14:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:14:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:14:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:14:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:14:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:14:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:14:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:14:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:14:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:14:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:14:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:14:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:14:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:14:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:14:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 06:14:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:14:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 06:14:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:14:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 06:14:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:14:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:49,855 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:14:49,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:14:49,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596603750] [2024-11-20 06:14:49,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596603750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:14:49,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:14:49,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:14:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976306432] [2024-11-20 06:14:49,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:14:49,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:14:49,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:14:49,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:14:49,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:14:49,857 INFO L87 Difference]: Start difference. First operand 577 states and 834 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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:14:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:14:49,988 INFO L93 Difference]: Finished difference Result 1431 states and 2077 transitions. [2024-11-20 06:14:49,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:14:49,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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:14:49,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:14:49,992 INFO L225 Difference]: With dead ends: 1431 [2024-11-20 06:14:49,992 INFO L226 Difference]: Without dead ends: 1016 [2024-11-20 06:14:49,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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:14:49,994 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 134 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:14:49,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 420 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:14:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-11-20 06:14:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1011. [2024-11-20 06:14:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 889 states have (on average 1.4015748031496063) internal successors, (1246), 895 states have internal predecessors, (1246), 103 states have call successors, (103), 18 states have call predecessors, (103), 18 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-20 06:14:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1452 transitions. [2024-11-20 06:14:50,042 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1452 transitions. Word has length 173 [2024-11-20 06:14:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:14:50,042 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1452 transitions. [2024-11-20 06:14:50,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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:14:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1452 transitions. [2024-11-20 06:14:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 06:14:50,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:14:50,044 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:14:50,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 06:14:50,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:14:50,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:14:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1819079144, now seen corresponding path program 1 times [2024-11-20 06:14:50,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:14:50,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810654526] [2024-11-20 06:14:50,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:50,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:14:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:14:50,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798063640] [2024-11-20 06:14:50,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:14:50,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:14:50,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:14:50,504 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:14:50,507 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:14:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:14:50,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-20 06:14:50,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:14:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 604 proven. 210 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2024-11-20 06:14:52,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:14:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 96 proven. 174 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2024-11-20 06:14:54,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:14:54,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810654526] [2024-11-20 06:14:54,297 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 06:14:54,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798063640] [2024-11-20 06:14:54,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798063640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:14:54,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 06:14:54,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 42 [2024-11-20 06:14:54,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703299566] [2024-11-20 06:14:54,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 06:14:54,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-20 06:14:54,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:14:54,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-20 06:14:54,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1328, Unknown=0, NotChecked=0, Total=1722 [2024-11-20 06:14:54,300 INFO L87 Difference]: Start difference. First operand 1011 states and 1452 transitions. Second operand has 42 states, 40 states have (on average 3.15) internal successors, (126), 38 states have internal predecessors, (126), 12 states have call successors, (50), 7 states have call predecessors, (50), 13 states have return successors, (50), 10 states have call predecessors, (50), 12 states have call successors, (50) [2024-11-20 06:15:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:15:03,446 INFO L93 Difference]: Finished difference Result 3922 states and 5513 transitions. [2024-11-20 06:15:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-11-20 06:15:03,447 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 3.15) internal successors, (126), 38 states have internal predecessors, (126), 12 states have call successors, (50), 7 states have call predecessors, (50), 13 states have return successors, (50), 10 states have call predecessors, (50), 12 states have call successors, (50) Word has length 173 [2024-11-20 06:15:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:15:03,456 INFO L225 Difference]: With dead ends: 3922 [2024-11-20 06:15:03,456 INFO L226 Difference]: Without dead ends: 3105 [2024-11-20 06:15:03,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4657 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2895, Invalid=11147, Unknown=0, NotChecked=0, Total=14042 [2024-11-20 06:15:03,461 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 5260 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5278 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 3011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-20 06:15:03,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5278 Valid, 1465 Invalid, 3011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-20 06:15:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states. [2024-11-20 06:15:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 1170. [2024-11-20 06:15:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1034 states have (on average 1.3936170212765957) internal successors, (1441), 1040 states have internal predecessors, (1441), 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:15:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1647 transitions. [2024-11-20 06:15:03,552 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1647 transitions. Word has length 173 [2024-11-20 06:15:03,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:15:03,552 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1647 transitions. [2024-11-20 06:15:03,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 3.15) internal successors, (126), 38 states have internal predecessors, (126), 12 states have call successors, (50), 7 states have call predecessors, (50), 13 states have return successors, (50), 10 states have call predecessors, (50), 12 states have call successors, (50) [2024-11-20 06:15:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1647 transitions. [2024-11-20 06:15:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 06:15:03,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:15:03,554 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:15:03,565 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:15:03,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:15:03,755 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:15:03,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:15:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2007821082, now seen corresponding path program 1 times [2024-11-20 06:15:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:15:03,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769594373] [2024-11-20 06:15:03,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:15:03,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:15:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:15:03,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [277177811] [2024-11-20 06:15:03,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:15:03,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:15:03,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:15:03,850 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:15:03,851 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:15:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:15:03,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:15:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:15:04,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:15:04,110 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:15:04,111 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:15:04,125 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:15:04,312 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,SelfDestructingSolverStorable14 [2024-11-20 06:15:04,315 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:15:04,429 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:15:04,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:15:04 BoogieIcfgContainer [2024-11-20 06:15:04,433 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:15:04,433 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:15:04,434 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:15:04,434 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:15:04,434 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:14:13" (3/4) ... [2024-11-20 06:15:04,436 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:15:04,437 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:15:04,437 INFO L158 Benchmark]: Toolchain (without parser) took 52025.22ms. Allocated memory was 134.2MB in the beginning and 906.0MB in the end (delta: 771.8MB). Free memory was 66.2MB in the beginning and 574.5MB in the end (delta: -508.2MB). Peak memory consumption was 266.3MB. Max. memory is 16.1GB. [2024-11-20 06:15:04,437 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 134.2MB. Free memory was 100.6MB in the beginning and 100.5MB in the end (delta: 140.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:15:04,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.53ms. Allocated memory was 134.2MB in the beginning and 209.7MB in the end (delta: 75.5MB). Free memory was 66.1MB in the beginning and 168.3MB in the end (delta: -102.2MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-11-20 06:15:04,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.64ms. Allocated memory is still 209.7MB. Free memory was 168.3MB in the beginning and 159.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-20 06:15:04,438 INFO L158 Benchmark]: Boogie Preprocessor took 95.63ms. Allocated memory is still 209.7MB. Free memory was 159.9MB in the beginning and 143.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 06:15:04,438 INFO L158 Benchmark]: RCFGBuilder took 671.84ms. Allocated memory is still 209.7MB. Free memory was 143.1MB in the beginning and 173.3MB in the end (delta: -30.2MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2024-11-20 06:15:04,438 INFO L158 Benchmark]: TraceAbstraction took 50687.14ms. Allocated memory was 209.7MB in the beginning and 906.0MB in the end (delta: 696.3MB). Free memory was 172.2MB in the beginning and 574.5MB in the end (delta: -402.2MB). Peak memory consumption was 294.2MB. Max. memory is 16.1GB. [2024-11-20 06:15:04,439 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 906.0MB. Free memory is still 574.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:15:04,440 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.09ms. Allocated memory is still 134.2MB. Free memory was 100.6MB in the beginning and 100.5MB in the end (delta: 140.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.53ms. Allocated memory was 134.2MB in the beginning and 209.7MB in the end (delta: 75.5MB). Free memory was 66.1MB in the beginning and 168.3MB in the end (delta: -102.2MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.64ms. Allocated memory is still 209.7MB. Free memory was 168.3MB in the beginning and 159.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.63ms. Allocated memory is still 209.7MB. Free memory was 159.9MB in the beginning and 143.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 671.84ms. Allocated memory is still 209.7MB. Free memory was 143.1MB in the beginning and 173.3MB in the end (delta: -30.2MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * TraceAbstraction took 50687.14ms. Allocated memory was 209.7MB in the beginning and 906.0MB in the end (delta: 696.3MB). Free memory was 172.2MB in the beginning and 574.5MB in the end (delta: -402.2MB). Peak memory consumption was 294.2MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 906.0MB. Free memory is still 574.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 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] int k_loop; [L200] k_loop = 0 VAL [isInitial=1, k_loop=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] [L200] COND TRUE k_loop < 1 [L201] 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] [L201] RET updateLastVariables() [L202] 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, var_1_7=16, var_1_9=0] [L202] RET updateVariables() [L203] 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, var_1_7=2, var_1_9=0] [L203] RET step() [L204] 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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) ; [L204] RET, EXPR property() [L204] 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, 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=176, var_1_29=320, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=-656, var_1_4=-256, var_1_7=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.5s, OverallIterations: 15, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11448 SdHoareTripleChecker+Valid, 14.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11390 mSDsluCounter, 10531 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8432 mSDsCounter, 1454 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10064 IncrementalHoareTripleChecker+Invalid, 11518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1454 mSolverCounterUnsat, 2099 mSDtfsCounter, 10064 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2048 GetRequests, 1701 SyntacticMatches, 2 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7342 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1170occurred in iteration=14, InterpolantAutomatonStates: 276, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 6601 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 22.0s InterpolantComputationTime, 3262 NumberOfCodeBlocks, 3262 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3241 ConstructedInterpolants, 0 QuantifiedInterpolants, 31753 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1262 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 22032/22800 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:15:04,660 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:15:04,694 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-1loop_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 e5900adef742c9bfa7a4740bfd6257cd40ef26644b367767fd6845fd72b79bbd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:15:06,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:15:06,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:15:06,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:15:06,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:15:06,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:15:06,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:15:06,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:15:06,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:15:06,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:15:06,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:15:06,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:15:06,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:15:06,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:15:06,770 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:15:06,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:15:06,770 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:15:06,771 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:15:06,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:15:06,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:15:06,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:15:06,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:15:06,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:15:06,774 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:15:06,775 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:15:06,775 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:15:06,775 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:15:06,775 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:15:06,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:15:06,775 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:15:06,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:15:06,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:15:06,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:15:06,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:15:06,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:15:06,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:15:06,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:15:06,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:15:06,778 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:15:06,779 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:15:06,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:15:06,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:15:06,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:15:06,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:15:06,780 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 -> e5900adef742c9bfa7a4740bfd6257cd40ef26644b367767fd6845fd72b79bbd [2024-11-20 06:15:07,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:15:07,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:15:07,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:15:07,101 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:15:07,101 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:15:07,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-53.i [2024-11-20 06:15:08,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:15:08,654 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:15:08,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-53.i [2024-11-20 06:15:08,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40d6ff2d/6bd2d09174874462be0e46d6ee446984/FLAGc5bceb64d [2024-11-20 06:15:08,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40d6ff2d/6bd2d09174874462be0e46d6ee446984 [2024-11-20 06:15:08,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:15:08,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:15:08,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:15:08,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:15:08,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:15:08,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:15:08" (1/1) ... [2024-11-20 06:15:08,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b733f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:08, skipping insertion in model container [2024-11-20 06:15:08,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:15:08" (1/1) ... [2024-11-20 06:15:08,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:15:08,880 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-1loop_file-53.i[916,929] [2024-11-20 06:15:08,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:15:09,007 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:15:09,020 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-1loop_file-53.i[916,929] [2024-11-20 06:15:09,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:15:09,088 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:15:09,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:09 WrapperNode [2024-11-20 06:15:09,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:15:09,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:15:09,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:15:09,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:15:09,095 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:15:09" (1/1) ... [2024-11-20 06:15:09,114 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:15:09" (1/1) ... [2024-11-20 06:15:09,148 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-11-20 06:15:09,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:15:09,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:15:09,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:15:09,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:15:09,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:09" (1/1) ... [2024-11-20 06:15:09,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:09" (1/1) ... [2024-11-20 06:15:09,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:09" (1/1) ... [2024-11-20 06:15:09,185 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:15:09,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:09" (1/1) ... [2024-11-20 06:15:09,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:09" (1/1) ... [2024-11-20 06:15:09,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:09" (1/1) ... [2024-11-20 06:15:09,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:09" (1/1) ... [2024-11-20 06:15:09,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:09" (1/1) ... [2024-11-20 06:15:09,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:09" (1/1) ... [2024-11-20 06:15:09,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:15:09,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:15:09,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:15:09,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:15:09,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:09" (1/1) ... [2024-11-20 06:15:09,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:15:09,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:15:09,239 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:15:09,241 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:15:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:15:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:15:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:15:09,279 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:15:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:15:09,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:15:09,339 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:15:09,341 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:15:22,981 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-20 06:15:22,981 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:15:22,992 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:15:22,992 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:15:22,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:15:22 BoogieIcfgContainer [2024-11-20 06:15:22,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:15:22,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:15:22,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:15:22,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:15:22,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:15:08" (1/3) ... [2024-11-20 06:15:22,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eac1d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:15:22, skipping insertion in model container [2024-11-20 06:15:22,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:15:09" (2/3) ... [2024-11-20 06:15:23,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eac1d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:15:22, skipping insertion in model container [2024-11-20 06:15:23,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:15:22" (3/3) ... [2024-11-20 06:15:23,001 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-53.i [2024-11-20 06:15:23,015 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:15:23,015 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:15:23,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:15:23,104 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;@19cd742c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:15:23,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:15:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 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:15:23,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 06:15:23,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:15:23,123 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] [2024-11-20 06:15:23,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:15:23,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:15:23,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1340327576, now seen corresponding path program 1 times [2024-11-20 06:15:23,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:15:23,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905105675] [2024-11-20 06:15:23,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:15:23,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:15:23,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:15:23,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:15:23,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 06:15:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:15:23,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:15:24,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:15:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2024-11-20 06:15:24,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:15:24,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:15:24,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905105675] [2024-11-20 06:15:24,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905105675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:15:24,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:15:24,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:15:24,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544215892] [2024-11-20 06:15:24,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:15:24,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:15:24,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:15:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:15:24,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:15:24,135 INFO L87 Difference]: Start difference. First operand has 86 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 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.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-20 06:15:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:15:24,162 INFO L93 Difference]: Finished difference Result 169 states and 286 transitions. [2024-11-20 06:15:24,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:15:24,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2024-11-20 06:15:24,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:15:24,170 INFO L225 Difference]: With dead ends: 169 [2024-11-20 06:15:24,170 INFO L226 Difference]: Without dead ends: 82 [2024-11-20 06:15:24,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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:15:24,175 INFO L432 NwaCegarLoop]: 129 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, 129 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:15:24,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:15:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-20 06:15:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-20 06:15:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 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:15:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2024-11-20 06:15:24,209 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 167 [2024-11-20 06:15:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:15:24,210 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2024-11-20 06:15:24,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-20 06:15:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2024-11-20 06:15:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 06:15:24,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:15:24,212 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] [2024-11-20 06:15:24,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 06:15:24,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:15:24,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:15:24,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:15:24,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1519785694, now seen corresponding path program 1 times [2024-11-20 06:15:24,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:15:24,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974888474] [2024-11-20 06:15:24,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:15:24,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:15:24,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:15:24,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:15:24,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 06:15:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:15:25,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 06:15:25,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:15:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 514 proven. 51 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-11-20 06:15:30,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:15:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 21 proven. 51 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-20 06:15:34,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:15:34,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974888474] [2024-11-20 06:15:34,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974888474] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:15:34,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 06:15:34,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-20 06:15:34,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366036339] [2024-11-20 06:15:34,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 06:15:34,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:15:34,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:15:34,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:15:34,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:15:34,564 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43)