./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-52.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 e7037638bfc89d1603e251f5487ce9312923d7aa6beb63f860e372ba0b9ad000 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:04:12,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:04:12,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:04:12,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:04:12,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:04:12,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:04:12,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:04:12,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:04:12,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:04:12,359 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:04:12,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:04:12,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:04:12,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:04:12,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:04:12,365 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:04:12,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:04:12,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:04:12,366 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:04:12,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:04:12,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:04:12,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:04:12,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:04:12,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:04:12,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:04:12,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:04:12,372 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:04:12,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:04:12,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:04:12,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:04:12,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:04:12,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:04:12,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:04:12,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:04:12,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:04:12,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:04:12,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:04:12,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:04:12,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:04:12,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:04:12,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:04:12,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:04:12,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:04:12,379 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 -> e7037638bfc89d1603e251f5487ce9312923d7aa6beb63f860e372ba0b9ad000 [2024-11-09 00:04:12,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:04:12,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:04:12,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:04:12,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:04:12,680 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:04:12,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-52.i [2024-11-09 00:04:14,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:04:14,545 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:04:14,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-52.i [2024-11-09 00:04:14,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0502e0d9/8104236fa07c4a64bd1468d26a9e988e/FLAGa92774b24 [2024-11-09 00:04:14,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0502e0d9/8104236fa07c4a64bd1468d26a9e988e [2024-11-09 00:04:14,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:04:14,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:04:14,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:04:14,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:04:14,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:04:14,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:04:14" (1/1) ... [2024-11-09 00:04:14,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36457e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:14, skipping insertion in model container [2024-11-09 00:04:14,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:04:14" (1/1) ... [2024-11-09 00:04:14,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:04:15,142 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_50-1loop_file-52.i[915,928] [2024-11-09 00:04:15,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:04:15,238 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:04:15,252 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_50-1loop_file-52.i[915,928] [2024-11-09 00:04:15,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:04:15,322 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:04:15,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:15 WrapperNode [2024-11-09 00:04:15,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:04:15,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:04:15,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:04:15,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:04:15,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:15" (1/1) ... [2024-11-09 00:04:15,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:15" (1/1) ... [2024-11-09 00:04:15,401 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-09 00:04:15,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:04:15,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:04:15,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:04:15,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:04:15,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:15" (1/1) ... [2024-11-09 00:04:15,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:15" (1/1) ... [2024-11-09 00:04:15,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:15" (1/1) ... [2024-11-09 00:04:15,435 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-09 00:04:15,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:15" (1/1) ... [2024-11-09 00:04:15,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:15" (1/1) ... [2024-11-09 00:04:15,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:15" (1/1) ... [2024-11-09 00:04:15,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:15" (1/1) ... [2024-11-09 00:04:15,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:15" (1/1) ... [2024-11-09 00:04:15,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:15" (1/1) ... [2024-11-09 00:04:15,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:04:15,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:04:15,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:04:15,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:04:15,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:15" (1/1) ... [2024-11-09 00:04:15,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:04:15,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:04:15,516 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-09 00:04:15,521 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-09 00:04:15,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:04:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:04:15,573 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:04:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:04:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:04:15,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:04:15,677 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:04:15,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:04:15,982 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-09 00:04:15,983 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:04:15,997 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:04:15,999 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:04:15,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:04:15 BoogieIcfgContainer [2024-11-09 00:04:15,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:04:16,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:04:16,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:04:16,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:04:16,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:04:14" (1/3) ... [2024-11-09 00:04:16,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360e06a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:04:16, skipping insertion in model container [2024-11-09 00:04:16,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:04:15" (2/3) ... [2024-11-09 00:04:16,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360e06a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:04:16, skipping insertion in model container [2024-11-09 00:04:16,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:04:15" (3/3) ... [2024-11-09 00:04:16,010 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-52.i [2024-11-09 00:04:16,026 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:04:16,026 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:04:16,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:04:16,100 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;@1c44e3c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:04:16,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:04:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 00:04:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 00:04:16,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:04:16,117 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:04:16,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:04:16,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:04:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1524109705, now seen corresponding path program 1 times [2024-11-09 00:04:16,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:04:16,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525080725] [2024-11-09 00:04:16,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:04:16,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:16,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:04:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:04:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:16,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:04:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:16,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:04:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:16,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:04:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:16,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:04:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:16,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:04:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:16,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:04:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:16,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:04:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:16,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:04:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:16,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:04:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:16,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:04:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:16,591 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 00:04:16,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:04:16,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525080725] [2024-11-09 00:04:16,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525080725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:04:16,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:04:16,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:04:16,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669637075] [2024-11-09 00:04:16,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:04:16,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:04:16,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:04:16,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:04:16,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:04:16,630 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 00:04:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:04:16,662 INFO L93 Difference]: Finished difference Result 103 states and 163 transitions. [2024-11-09 00:04:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:04:16,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 86 [2024-11-09 00:04:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:04:16,674 INFO L225 Difference]: With dead ends: 103 [2024-11-09 00:04:16,674 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 00:04:16,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-09 00:04:16,683 INFO L432 NwaCegarLoop]: 74 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, 74 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-09 00:04:16,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:04:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 00:04:16,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-09 00:04:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 00:04:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-09 00:04:16,734 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 86 [2024-11-09 00:04:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:04:16,734 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-09 00:04:16,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 00:04:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-09 00:04:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 00:04:16,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:04:16,739 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:04:16,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:04:16,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:04:16,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:04:16,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1648224649, now seen corresponding path program 1 times [2024-11-09 00:04:16,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:04:16,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843674383] [2024-11-09 00:04:16,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:04:16,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:26,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:04:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:26,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:04:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:26,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:04:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:26,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:04:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:26,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:04:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:26,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:04:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:26,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:04:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:26,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:04:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:26,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:04:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:26,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:04:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:26,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:04:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:27,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:04:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 00:04:27,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:04:27,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843674383] [2024-11-09 00:04:27,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843674383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:04:27,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:04:27,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 00:04:27,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119987295] [2024-11-09 00:04:27,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:04:27,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:04:27,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:04:27,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:04:27,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:04:27,018 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:04:27,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:04:27,932 INFO L93 Difference]: Finished difference Result 211 states and 298 transitions. [2024-11-09 00:04:27,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:04:27,933 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-09 00:04:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:04:27,936 INFO L225 Difference]: With dead ends: 211 [2024-11-09 00:04:27,936 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 00:04:27,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-09 00:04:27,939 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 257 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:04:27,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 402 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 00:04:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 00:04:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 122. [2024-11-09 00:04:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 89 states have internal predecessors, (114), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 00:04:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2024-11-09 00:04:27,967 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 86 [2024-11-09 00:04:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:04:27,967 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2024-11-09 00:04:27,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:04:27,968 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2024-11-09 00:04:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 00:04:27,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:04:27,970 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:04:27,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:04:27,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:04:27,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:04:27,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1390059211, now seen corresponding path program 1 times [2024-11-09 00:04:27,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:04:27,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776113755] [2024-11-09 00:04:27,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:04:27,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:04:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:04:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:04:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:04:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:04:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:04:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:04:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:04:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:04:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:04:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:04:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:04:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 00:04:28,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:04:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776113755] [2024-11-09 00:04:28,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776113755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:04:28,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:04:28,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:04:28,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921540007] [2024-11-09 00:04:28,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:04:28,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:04:28,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:04:28,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:04:28,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:04:28,365 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:04:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:04:28,509 INFO L93 Difference]: Finished difference Result 308 states and 431 transitions. [2024-11-09 00:04:28,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:04:28,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-09 00:04:28,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:04:28,517 INFO L225 Difference]: With dead ends: 308 [2024-11-09 00:04:28,518 INFO L226 Difference]: Without dead ends: 189 [2024-11-09 00:04:28,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:04:28,521 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 80 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:04:28,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 172 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:04:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-09 00:04:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 117. [2024-11-09 00:04:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:04:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 161 transitions. [2024-11-09 00:04:28,548 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 161 transitions. Word has length 86 [2024-11-09 00:04:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:04:28,550 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 161 transitions. [2024-11-09 00:04:28,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:04:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 161 transitions. [2024-11-09 00:04:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 00:04:28,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:04:28,556 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:04:28,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:04:28,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:04:28,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:04:28,558 INFO L85 PathProgramCache]: Analyzing trace with hash -75496907, now seen corresponding path program 1 times [2024-11-09 00:04:28,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:04:28,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989534619] [2024-11-09 00:04:28,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:04:28,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:04:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:04:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:04:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:04:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:04:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:04:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:04:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:04:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:04:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:04:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:04:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:04:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 00:04:28,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:04:28,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989534619] [2024-11-09 00:04:28,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989534619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:04:28,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:04:28,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:04:28,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366848024] [2024-11-09 00:04:28,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:04:28,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:04:28,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:04:28,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:04:28,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:04:28,742 INFO L87 Difference]: Start difference. First operand 117 states and 161 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:04:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:04:28,858 INFO L93 Difference]: Finished difference Result 342 states and 472 transitions. [2024-11-09 00:04:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:04:28,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-09 00:04:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:04:28,863 INFO L225 Difference]: With dead ends: 342 [2024-11-09 00:04:28,864 INFO L226 Difference]: Without dead ends: 228 [2024-11-09 00:04:28,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-09 00:04:28,869 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 95 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:04:28,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 227 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:04:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-09 00:04:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 120. [2024-11-09 00:04:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 91 states have internal predecessors, (116), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:04:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 164 transitions. [2024-11-09 00:04:28,893 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 164 transitions. Word has length 86 [2024-11-09 00:04:28,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:04:28,894 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 164 transitions. [2024-11-09 00:04:28,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:04:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 164 transitions. [2024-11-09 00:04:28,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 00:04:28,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:04:28,897 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:04:28,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:04:28,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:04:28,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:04:28,898 INFO L85 PathProgramCache]: Analyzing trace with hash -333662345, now seen corresponding path program 1 times [2024-11-09 00:04:28,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:04:28,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462762461] [2024-11-09 00:04:28,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:04:28,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:36,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:04:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:36,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:04:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:36,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:04:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:36,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:04:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:36,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:04:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:36,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:04:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:04:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:36,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:04:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:36,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:04:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:36,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:04:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:36,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:04:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:04:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 00:04:36,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:04:36,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462762461] [2024-11-09 00:04:36,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462762461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:04:36,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:04:36,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 00:04:36,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402650956] [2024-11-09 00:04:36,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:04:36,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:04:36,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:04:36,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:04:36,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:04:37,000 INFO L87 Difference]: Start difference. First operand 120 states and 164 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:04:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:04:40,418 INFO L93 Difference]: Finished difference Result 187 states and 247 transitions. [2024-11-09 00:04:40,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 00:04:40,419 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-09 00:04:40,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:04:40,420 INFO L225 Difference]: With dead ends: 187 [2024-11-09 00:04:40,420 INFO L226 Difference]: Without dead ends: 185 [2024-11-09 00:04:40,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=302, Invalid=820, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 00:04:40,422 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 236 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:04:40,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 391 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 00:04:40,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-09 00:04:40,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 124. [2024-11-09 00:04:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 95 states have (on average 1.263157894736842) internal successors, (120), 95 states have internal predecessors, (120), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:04:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 168 transitions. [2024-11-09 00:04:40,450 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 168 transitions. Word has length 86 [2024-11-09 00:04:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:04:40,451 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 168 transitions. [2024-11-09 00:04:40,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:04:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 168 transitions. [2024-11-09 00:04:40,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 00:04:40,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:04:40,452 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:04:40,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 00:04:40,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:04:40,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:04:40,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1366878969, now seen corresponding path program 1 times [2024-11-09 00:04:40,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:04:40,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006087078] [2024-11-09 00:04:40,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:04:40,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:40,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:04:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:40,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:04:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:40,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:04:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:40,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:04:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:40,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:04:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:04:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:40,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:04:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:40,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:04:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:40,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:04:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:40,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:04:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:40,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:04:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:40,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:04:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 00:04:40,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:04:40,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006087078] [2024-11-09 00:04:40,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006087078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:04:40,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:04:40,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:04:40,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98085334] [2024-11-09 00:04:40,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:04:40,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:04:40,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:04:40,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:04:40,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:04:40,596 INFO L87 Difference]: Start difference. First operand 124 states and 168 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:04:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:04:40,687 INFO L93 Difference]: Finished difference Result 182 states and 247 transitions. [2024-11-09 00:04:40,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:04:40,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-09 00:04:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:04:40,691 INFO L225 Difference]: With dead ends: 182 [2024-11-09 00:04:40,691 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 00:04:40,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:04:40,694 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 76 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:04:40,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 96 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:04:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 00:04:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-09 00:04:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 92 states have internal predecessors, (113), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:04:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 161 transitions. [2024-11-09 00:04:40,714 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 161 transitions. Word has length 86 [2024-11-09 00:04:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:04:40,715 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 161 transitions. [2024-11-09 00:04:40,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:04:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions. [2024-11-09 00:04:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 00:04:40,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:04:40,718 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:04:40,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 00:04:40,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:04:40,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:04:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1516418713, now seen corresponding path program 1 times [2024-11-09 00:04:40,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:04:40,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638410203] [2024-11-09 00:04:40,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:04:40,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:42,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:04:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:04:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:04:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:04:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:42,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:04:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:42,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:04:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:42,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:04:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:42,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:04:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:42,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:04:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:42,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:04:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:42,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:04:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:42,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:04:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 00:04:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:04:42,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638410203] [2024-11-09 00:04:42,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638410203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:04:42,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:04:42,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 00:04:42,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275184617] [2024-11-09 00:04:42,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:04:42,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 00:04:42,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:04:42,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 00:04:42,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:04:42,859 INFO L87 Difference]: Start difference. First operand 121 states and 161 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 00:04:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:04:43,205 INFO L93 Difference]: Finished difference Result 298 states and 396 transitions. [2024-11-09 00:04:43,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:04:43,206 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 87 [2024-11-09 00:04:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:04:43,208 INFO L225 Difference]: With dead ends: 298 [2024-11-09 00:04:43,208 INFO L226 Difference]: Without dead ends: 180 [2024-11-09 00:04:43,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-09 00:04:43,209 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 72 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:04:43,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 354 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:04:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-09 00:04:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 152. [2024-11-09 00:04:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.1926605504587156) internal successors, (130), 109 states have internal predecessors, (130), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 00:04:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 202 transitions. [2024-11-09 00:04:43,239 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 202 transitions. Word has length 87 [2024-11-09 00:04:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:04:43,240 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 202 transitions. [2024-11-09 00:04:43,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 00:04:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 202 transitions. [2024-11-09 00:04:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 00:04:43,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:04:43,242 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:04:43,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 00:04:43,243 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:04:43,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:04:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash -95016809, now seen corresponding path program 1 times [2024-11-09 00:04:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:04:43,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275718231] [2024-11-09 00:04:43,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:04:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:04:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:47,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:04:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:47,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:04:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:04:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:04:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:04:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:47,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:04:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:47,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:04:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:04:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:47,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:04:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:47,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:04:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:47,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:04:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 00:04:47,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:04:47,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275718231] [2024-11-09 00:04:47,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275718231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:04:47,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:04:47,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 00:04:47,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036984096] [2024-11-09 00:04:47,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:04:47,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 00:04:47,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:04:47,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 00:04:47,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-09 00:04:47,527 INFO L87 Difference]: Start difference. First operand 152 states and 202 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 00:04:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:04:49,261 INFO L93 Difference]: Finished difference Result 443 states and 587 transitions. [2024-11-09 00:04:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 00:04:49,266 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 87 [2024-11-09 00:04:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:04:49,268 INFO L225 Difference]: With dead ends: 443 [2024-11-09 00:04:49,268 INFO L226 Difference]: Without dead ends: 325 [2024-11-09 00:04:49,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=313, Invalid=809, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 00:04:49,270 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 326 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:04:49,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 380 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 00:04:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-09 00:04:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 280. [2024-11-09 00:04:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 209 states have (on average 1.2105263157894737) internal successors, (253), 209 states have internal predecessors, (253), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:04:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 373 transitions. [2024-11-09 00:04:49,304 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 373 transitions. Word has length 87 [2024-11-09 00:04:49,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:04:49,305 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 373 transitions. [2024-11-09 00:04:49,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 00:04:49,305 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 373 transitions. [2024-11-09 00:04:49,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 00:04:49,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:04:49,306 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:04:49,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 00:04:49,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:04:49,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:04:49,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1702099085, now seen corresponding path program 1 times [2024-11-09 00:04:49,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:04:49,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417699948] [2024-11-09 00:04:49,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:04:49,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:53,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:04:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:53,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:04:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:53,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:04:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:53,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:04:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:53,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:04:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:53,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:04:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:53,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:04:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:53,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:04:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:53,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:04:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:53,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:04:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:53,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:04:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:53,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:04:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 00:04:53,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:04:53,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417699948] [2024-11-09 00:04:53,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417699948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:04:53,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:04:53,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 00:04:53,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031151594] [2024-11-09 00:04:53,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:04:53,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 00:04:53,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:04:53,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 00:04:53,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-09 00:04:53,337 INFO L87 Difference]: Start difference. First operand 280 states and 373 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:04:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:04:54,602 INFO L93 Difference]: Finished difference Result 504 states and 668 transitions. [2024-11-09 00:04:54,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 00:04:54,602 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-11-09 00:04:54,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:04:54,605 INFO L225 Difference]: With dead ends: 504 [2024-11-09 00:04:54,605 INFO L226 Difference]: Without dead ends: 382 [2024-11-09 00:04:54,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2024-11-09 00:04:54,608 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 215 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:04:54,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 231 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 00:04:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-09 00:04:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 298. [2024-11-09 00:04:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 227 states have (on average 1.2202643171806167) internal successors, (277), 227 states have internal predecessors, (277), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:04:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 397 transitions. [2024-11-09 00:04:54,648 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 397 transitions. Word has length 87 [2024-11-09 00:04:54,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:04:54,648 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 397 transitions. [2024-11-09 00:04:54,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:04:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 397 transitions. [2024-11-09 00:04:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 00:04:54,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:04:54,650 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:04:54,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 00:04:54,650 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:04:54,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:04:54,651 INFO L85 PathProgramCache]: Analyzing trace with hash -214220584, now seen corresponding path program 1 times [2024-11-09 00:04:54,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:04:54,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182910874] [2024-11-09 00:04:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:04:54,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:54,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:04:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:54,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:04:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:54,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:04:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:54,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:04:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:54,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:04:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:54,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:04:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:54,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:04:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:54,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:04:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:54,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:04:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:54,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:04:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:54,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:04:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:54,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:04:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 00:04:54,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:04:54,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182910874] [2024-11-09 00:04:54,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182910874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:04:54,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:04:54,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:04:54,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723865678] [2024-11-09 00:04:54,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:04:54,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:04:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:04:54,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:04:54,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:04:54,756 INFO L87 Difference]: Start difference. First operand 298 states and 397 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:04:54,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:04:54,898 INFO L93 Difference]: Finished difference Result 741 states and 984 transitions. [2024-11-09 00:04:54,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:04:54,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-09 00:04:54,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:04:54,905 INFO L225 Difference]: With dead ends: 741 [2024-11-09 00:04:54,906 INFO L226 Difference]: Without dead ends: 477 [2024-11-09 00:04:54,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:04:54,908 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 129 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:04:54,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 273 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:04:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-09 00:04:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 304. [2024-11-09 00:04:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 233 states have (on average 1.1974248927038627) internal successors, (279), 233 states have internal predecessors, (279), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:04:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 399 transitions. [2024-11-09 00:04:54,955 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 399 transitions. Word has length 88 [2024-11-09 00:04:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:04:54,955 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 399 transitions. [2024-11-09 00:04:54,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:04:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 399 transitions. [2024-11-09 00:04:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 00:04:54,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:04:54,957 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:04:54,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 00:04:54,958 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:04:54,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:04:54,958 INFO L85 PathProgramCache]: Analyzing trace with hash 148128081, now seen corresponding path program 1 times [2024-11-09 00:04:54,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:04:54,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808914469] [2024-11-09 00:04:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:04:54,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:04:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:04:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:04:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:04:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:04:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:04:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:04:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:04:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:04:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:04:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:04:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:04:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:04:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:04:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:04:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:04:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:04:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:04:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:04:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:04:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:04:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 00:04:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 00:04:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 00:04:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 00:04:55,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:04:55,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808914469] [2024-11-09 00:04:55,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808914469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:04:55,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521406915] [2024-11-09 00:04:55,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:04:55,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:04:55,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:04:55,103 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-09 00:04:55,104 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-09 00:04:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:55,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 00:04:55,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:04:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 609 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-11-09 00:04:55,380 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:04:55,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521406915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:04:55,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 00:04:55,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-09 00:04:55,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640289128] [2024-11-09 00:04:55,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:04:55,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:04:55,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:04:55,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:04:55,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:04:55,383 INFO L87 Difference]: Start difference. First operand 304 states and 399 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 00:04:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:04:55,443 INFO L93 Difference]: Finished difference Result 336 states and 437 transitions. [2024-11-09 00:04:55,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:04:55,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 171 [2024-11-09 00:04:55,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:04:55,445 INFO L225 Difference]: With dead ends: 336 [2024-11-09 00:04:55,445 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 00:04:55,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 219 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-09 00:04:55,446 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:04:55,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:04:55,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 00:04:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 00:04:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 00:04:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 00:04:55,448 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 171 [2024-11-09 00:04:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:04:55,448 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 00:04:55,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 00:04:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 00:04:55,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:04:55,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:04:55,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:04:55,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 00:04:55,660 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:04:55,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 00:04:57,596 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:04:57,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:04:57 BoogieIcfgContainer [2024-11-09 00:04:57,628 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:04:57,628 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:04:57,628 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:04:57,629 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:04:57,629 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:04:15" (3/4) ... [2024-11-09 00:04:57,631 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:04:57,636 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 00:04:57,642 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 00:04:57,643 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 00:04:57,643 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:04:57,643 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:04:57,762 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 00:04:57,763 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 00:04:57,763 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:04:57,764 INFO L158 Benchmark]: Toolchain (without parser) took 42849.67ms. Allocated memory was 148.9MB in the beginning and 826.3MB in the end (delta: 677.4MB). Free memory was 92.7MB in the beginning and 401.4MB in the end (delta: -308.7MB). Peak memory consumption was 370.5MB. Max. memory is 16.1GB. [2024-11-09 00:04:57,764 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 148.9MB. Free memory was 108.5MB in the beginning and 108.3MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:04:57,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.71ms. Allocated memory is still 148.9MB. Free memory was 92.7MB in the beginning and 77.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 00:04:57,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.84ms. Allocated memory is still 148.9MB. Free memory was 77.3MB in the beginning and 74.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:04:57,765 INFO L158 Benchmark]: Boogie Preprocessor took 65.49ms. Allocated memory is still 148.9MB. Free memory was 74.6MB in the beginning and 70.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:04:57,766 INFO L158 Benchmark]: RCFGBuilder took 524.70ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 70.4MB in the beginning and 147.7MB in the end (delta: -77.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-11-09 00:04:57,766 INFO L158 Benchmark]: TraceAbstraction took 41624.35ms. Allocated memory was 188.7MB in the beginning and 826.3MB in the end (delta: 637.5MB). Free memory was 146.6MB in the beginning and 407.6MB in the end (delta: -261.0MB). Peak memory consumption was 484.5MB. Max. memory is 16.1GB. [2024-11-09 00:04:57,766 INFO L158 Benchmark]: Witness Printer took 134.74ms. Allocated memory is still 826.3MB. Free memory was 407.6MB in the beginning and 401.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:04:57,768 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 148.9MB. Free memory was 108.5MB in the beginning and 108.3MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.71ms. Allocated memory is still 148.9MB. Free memory was 92.7MB in the beginning and 77.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.84ms. Allocated memory is still 148.9MB. Free memory was 77.3MB in the beginning and 74.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.49ms. Allocated memory is still 148.9MB. Free memory was 74.6MB in the beginning and 70.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 524.70ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 70.4MB in the beginning and 147.7MB in the end (delta: -77.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 41624.35ms. Allocated memory was 188.7MB in the beginning and 826.3MB in the end (delta: 637.5MB). Free memory was 146.6MB in the beginning and 407.6MB in the end (delta: -261.0MB). Peak memory consumption was 484.5MB. Max. memory is 16.1GB. * Witness Printer took 134.74ms. Allocated memory is still 826.3MB. Free memory was 407.6MB in the beginning and 401.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.6s, OverallIterations: 11, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1492 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1492 mSDsluCounter, 2718 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2004 mSDsCounter, 399 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2451 IncrementalHoareTripleChecker+Invalid, 2850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 399 mSolverCounterUnsat, 714 mSDtfsCounter, 2451 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 646 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=10, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 614 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 1207 NumberOfCodeBlocks, 1207 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1195 ConstructedInterpolants, 0 QuantifiedInterpolants, 8935 SizeOfPredicates, 0 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 4913/4914 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((1 <= k_loop) && ((256 + var_1_22) <= 0)) && ((999999950 + var_1_8) == (((long long) ((int) var_1_9 + last_1_var_1_20) + var_1_17) + var_1_10))) && (128 <= last_1_var_1_17)) && (((long long) 256 + var_1_11) <= 0)) && ((((var_1_12 == 1) && (var_1_14 != 0)) && (var_1_13 != 0)) || ((var_1_12 == 0) && ((var_1_14 == 0) || (var_1_13 == 0))))) || (((((((((((128 <= var_1_20) && (((long long) var_1_7 + var_1_20) <= 192)) && (64 == var_1_7)) && ((((999999950 + var_1_8) == (((long long) ((int) var_1_9 + last_1_var_1_20) + var_1_17) + var_1_10)) && ((((var_1_12 == 1) && (var_1_14 != 0)) && (var_1_13 != 0)) || ((var_1_12 == 0) && ((var_1_14 == 0) || (var_1_13 == 0))))) || ((var_1_12 == 0) && ((var_1_14 == 0) || (var_1_13 == 0))))) && (0 <= k_loop)) && (128 <= last_1_var_1_17)) && (0 <= 0)) && (((long long) 256 + var_1_11) <= 0)) && (((long long) var_1_7 + last_1_var_1_20) <= 192)) && (0 == 0)) && (128 <= var_1_17))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((((((128 == var_1_20) && (64 == var_1_7)) && (last_1_var_1_20 <= 128)) && (128 <= last_1_var_1_17)) && (0 <= 0)) && (((long long) 256 + var_1_11) <= 0)) && (0 == 0)) && (128 <= var_1_17)) Ensures: (((((((((128 == var_1_20) && (64 == var_1_7)) && (last_1_var_1_20 <= 128)) && (128 <= last_1_var_1_17)) && (0 <= 0)) && (((long long) 256 + var_1_11) <= 0)) && (0 == 0)) && (128 <= var_1_17)) && ((((((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (var_1_19 == \old(var_1_19))) && (var_1_20 == \old(var_1_20))) && (var_1_21 == \old(var_1_21))) && (var_1_22 == \old(var_1_22))) && (last_1_var_1_7 == \old(last_1_var_1_7))) && (last_1_var_1_17 == \old(last_1_var_1_17))) && (last_1_var_1_20 == \old(last_1_var_1_20)))) RESULT: Ultimate proved your program to be correct! [2024-11-09 00:04:57,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE