./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.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 211bead296e124e614440acc5c0a2ec479c384857f4a7a38003b7b558015a0bc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:28:46,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:28:46,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:28:46,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:28:46,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:28:46,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:28:46,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:28:46,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:28:46,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:28:46,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:28:46,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:28:46,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:28:46,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:28:46,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:28:46,641 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:28:46,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:28:46,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:28:46,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:28:46,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:28:46,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:28:46,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:28:46,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:28:46,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:28:46,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:28:46,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:28:46,646 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:28:46,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:28:46,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:28:46,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:28:46,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:28:46,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:28:46,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:28:46,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:28:46,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:28:46,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:28:46,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:28:46,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:28:46,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:28:46,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:28:46,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:28:46,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:28:46,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:28:46,666 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 -> 211bead296e124e614440acc5c0a2ec479c384857f4a7a38003b7b558015a0bc [2024-11-12 05:28:46,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:28:46,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:28:46,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:28:46,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:28:46,943 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:28:46,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i [2024-11-12 05:28:48,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:28:48,647 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:28:48,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i [2024-11-12 05:28:48,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fafebf50/7d7532997ebd4c07a3e70d997fbd6c3b/FLAG46c0bf005 [2024-11-12 05:28:49,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fafebf50/7d7532997ebd4c07a3e70d997fbd6c3b [2024-11-12 05:28:49,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:28:49,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:28:49,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:28:49,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:28:49,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:28:49,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:28:49" (1/1) ... [2024-11-12 05:28:49,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd714f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49, skipping insertion in model container [2024-11-12 05:28:49,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:28:49" (1/1) ... [2024-11-12 05:28:49,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:28:49,258 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_25-while_file-22.i[915,928] [2024-11-12 05:28:49,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:28:49,324 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:28:49,336 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_25-while_file-22.i[915,928] [2024-11-12 05:28:49,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:28:49,381 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:28:49,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49 WrapperNode [2024-11-12 05:28:49,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:28:49,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:28:49,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:28:49,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:28:49,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49" (1/1) ... [2024-11-12 05:28:49,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49" (1/1) ... [2024-11-12 05:28:49,434 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-12 05:28:49,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:28:49,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:28:49,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:28:49,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:28:49,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49" (1/1) ... [2024-11-12 05:28:49,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49" (1/1) ... [2024-11-12 05:28:49,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49" (1/1) ... [2024-11-12 05:28:49,467 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:28:49,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49" (1/1) ... [2024-11-12 05:28:49,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49" (1/1) ... [2024-11-12 05:28:49,477 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49" (1/1) ... [2024-11-12 05:28:49,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49" (1/1) ... [2024-11-12 05:28:49,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49" (1/1) ... [2024-11-12 05:28:49,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49" (1/1) ... [2024-11-12 05:28:49,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:28:49,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:28:49,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:28:49,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:28:49,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49" (1/1) ... [2024-11-12 05:28:49,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:28:49,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:28:49,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:28:49,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:28:49,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:28:49,590 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:28:49,591 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:28:49,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:28:49,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:28:49,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:28:49,670 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:28:49,675 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:28:49,940 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 05:28:49,941 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:28:49,951 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:28:49,952 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:28:49,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:28:49 BoogieIcfgContainer [2024-11-12 05:28:49,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:28:49,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:28:49,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:28:49,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:28:49,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:28:49" (1/3) ... [2024-11-12 05:28:49,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d61f508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:28:49, skipping insertion in model container [2024-11-12 05:28:49,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:49" (2/3) ... [2024-11-12 05:28:49,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d61f508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:28:49, skipping insertion in model container [2024-11-12 05:28:49,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:28:49" (3/3) ... [2024-11-12 05:28:49,963 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-22.i [2024-11-12 05:28:49,976 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:28:49,977 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:28:50,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:28:50,032 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;@7385323d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:28:50,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:28:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 05:28:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 05:28:50,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:50,046 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:28:50,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:50,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:50,052 INFO L85 PathProgramCache]: Analyzing trace with hash 816987956, now seen corresponding path program 1 times [2024-11-12 05:28:50,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:50,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473318165] [2024-11-12 05:28:50,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:50,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:50,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:50,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:50,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:50,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:50,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:50,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-12 05:28:50,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:50,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473318165] [2024-11-12 05:28:50,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473318165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:50,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:50,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:28:50,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868721181] [2024-11-12 05:28:50,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:50,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:28:50,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:50,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:28:50,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:28:50,393 INFO L87 Difference]: Start difference. First operand has 48 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-12 05:28:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:50,420 INFO L93 Difference]: Finished difference Result 87 states and 135 transitions. [2024-11-12 05:28:50,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:28:50,423 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-11-12 05:28:50,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:50,430 INFO L225 Difference]: With dead ends: 87 [2024-11-12 05:28:50,430 INFO L226 Difference]: Without dead ends: 42 [2024-11-12 05:28:50,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:28:50,438 INFO L435 NwaCegarLoop]: 56 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, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:50,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:28:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-12 05:28:50,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-12 05:28:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 05:28:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2024-11-12 05:28:50,477 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 58 [2024-11-12 05:28:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:50,478 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2024-11-12 05:28:50,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-12 05:28:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2024-11-12 05:28:50,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 05:28:50,480 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:50,481 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:28:50,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:28:50,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:50,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:50,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1731713732, now seen corresponding path program 1 times [2024-11-12 05:28:50,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:50,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880796662] [2024-11-12 05:28:50,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:50,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-12 05:28:51,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:51,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880796662] [2024-11-12 05:28:51,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880796662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:51,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:51,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:28:51,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360155241] [2024-11-12 05:28:51,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:51,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:28:51,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:51,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:28:51,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:28:51,252 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:51,466 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2024-11-12 05:28:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:28:51,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2024-11-12 05:28:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:51,470 INFO L225 Difference]: With dead ends: 141 [2024-11-12 05:28:51,471 INFO L226 Difference]: Without dead ends: 102 [2024-11-12 05:28:51,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:28:51,473 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 84 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:51,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 185 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:28:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-12 05:28:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 72. [2024-11-12 05:28:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 55 states have internal predecessors, (69), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 05:28:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2024-11-12 05:28:51,495 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 58 [2024-11-12 05:28:51,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:51,496 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2024-11-12 05:28:51,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2024-11-12 05:28:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 05:28:51,499 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:51,499 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:28:51,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:28:51,501 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:51,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:51,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1626275922, now seen corresponding path program 1 times [2024-11-12 05:28:51,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:51,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795184591] [2024-11-12 05:28:51,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:51,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-12 05:28:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795184591] [2024-11-12 05:28:51,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795184591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:51,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:51,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:28:51,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502844055] [2024-11-12 05:28:51,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:51,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:28:52,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:52,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:28:52,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:28:52,001 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:52,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:52,254 INFO L93 Difference]: Finished difference Result 212 states and 281 transitions. [2024-11-12 05:28:52,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:28:52,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-11-12 05:28:52,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:52,259 INFO L225 Difference]: With dead ends: 212 [2024-11-12 05:28:52,259 INFO L226 Difference]: Without dead ends: 173 [2024-11-12 05:28:52,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:28:52,261 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 89 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:52,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 221 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:28:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-12 05:28:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 117. [2024-11-12 05:28:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.2717391304347827) internal successors, (117), 92 states have internal predecessors, (117), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 05:28:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 159 transitions. [2024-11-12 05:28:52,292 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 159 transitions. Word has length 59 [2024-11-12 05:28:52,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:52,292 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 159 transitions. [2024-11-12 05:28:52,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:52,294 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 159 transitions. [2024-11-12 05:28:52,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 05:28:52,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:52,297 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:28:52,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:28:52,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:52,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:52,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2081885360, now seen corresponding path program 1 times [2024-11-12 05:28:52,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:52,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209716359] [2024-11-12 05:28:52,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:52,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-12 05:28:52,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:52,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209716359] [2024-11-12 05:28:52,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209716359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:52,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:52,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:28:52,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438609380] [2024-11-12 05:28:52,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:52,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:28:52,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:52,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:28:52,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:28:52,389 INFO L87 Difference]: Start difference. First operand 117 states and 159 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:52,411 INFO L93 Difference]: Finished difference Result 186 states and 250 transitions. [2024-11-12 05:28:52,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:28:52,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-11-12 05:28:52,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:52,413 INFO L225 Difference]: With dead ends: 186 [2024-11-12 05:28:52,413 INFO L226 Difference]: Without dead ends: 147 [2024-11-12 05:28:52,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:28:52,415 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 25 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:52,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 117 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:28:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-12 05:28:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 121. [2024-11-12 05:28:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.2604166666666667) internal successors, (121), 96 states have internal predecessors, (121), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 05:28:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 163 transitions. [2024-11-12 05:28:52,430 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 163 transitions. Word has length 59 [2024-11-12 05:28:52,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:52,430 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 163 transitions. [2024-11-12 05:28:52,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 163 transitions. [2024-11-12 05:28:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 05:28:52,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:52,432 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:28:52,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:28:52,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:52,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:52,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1824120838, now seen corresponding path program 1 times [2024-11-12 05:28:52,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:52,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592591991] [2024-11-12 05:28:52,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:52,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-12 05:28:52,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:52,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592591991] [2024-11-12 05:28:52,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592591991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:52,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:52,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:28:52,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224605963] [2024-11-12 05:28:52,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:52,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:28:52,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:52,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:28:52,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:28:52,694 INFO L87 Difference]: Start difference. First operand 121 states and 163 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:52,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:52,799 INFO L93 Difference]: Finished difference Result 275 states and 369 transitions. [2024-11-12 05:28:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:28:52,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-11-12 05:28:52,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:52,802 INFO L225 Difference]: With dead ends: 275 [2024-11-12 05:28:52,802 INFO L226 Difference]: Without dead ends: 176 [2024-11-12 05:28:52,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-12 05:28:52,807 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 53 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:52,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 147 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:28:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-12 05:28:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 121. [2024-11-12 05:28:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 05:28:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 162 transitions. [2024-11-12 05:28:52,836 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 162 transitions. Word has length 59 [2024-11-12 05:28:52,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:52,837 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 162 transitions. [2024-11-12 05:28:52,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 162 transitions. [2024-11-12 05:28:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 05:28:52,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:52,840 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:28:52,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 05:28:52,840 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:52,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1444451272, now seen corresponding path program 1 times [2024-11-12 05:28:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:52,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119146588] [2024-11-12 05:28:52,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:52,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-12 05:28:54,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:54,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119146588] [2024-11-12 05:28:54,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119146588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:54,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:54,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 05:28:54,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499915812] [2024-11-12 05:28:54,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:54,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 05:28:54,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:54,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 05:28:54,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:28:54,083 INFO L87 Difference]: Start difference. First operand 121 states and 162 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:54,351 INFO L93 Difference]: Finished difference Result 339 states and 450 transitions. [2024-11-12 05:28:54,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 05:28:54,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2024-11-12 05:28:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:54,353 INFO L225 Difference]: With dead ends: 339 [2024-11-12 05:28:54,355 INFO L226 Difference]: Without dead ends: 240 [2024-11-12 05:28:54,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-12 05:28:54,357 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 170 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:54,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 317 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:28:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-12 05:28:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 112. [2024-11-12 05:28:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 87 states have internal predecessors, (106), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 05:28:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 148 transitions. [2024-11-12 05:28:54,385 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 148 transitions. Word has length 60 [2024-11-12 05:28:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:54,387 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 148 transitions. [2024-11-12 05:28:54,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2024-11-12 05:28:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 05:28:54,388 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:54,391 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:28:54,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 05:28:54,391 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:54,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:54,392 INFO L85 PathProgramCache]: Analyzing trace with hash 719275552, now seen corresponding path program 1 times [2024-11-12 05:28:54,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:54,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225815260] [2024-11-12 05:28:54,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:54,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-12 05:28:54,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:54,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225815260] [2024-11-12 05:28:54,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225815260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:54,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:54,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:28:54,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466179089] [2024-11-12 05:28:54,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:54,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:28:54,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:54,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:28:54,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:28:54,454 INFO L87 Difference]: Start difference. First operand 112 states and 148 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:54,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:54,508 INFO L93 Difference]: Finished difference Result 278 states and 371 transitions. [2024-11-12 05:28:54,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:28:54,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2024-11-12 05:28:54,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:54,511 INFO L225 Difference]: With dead ends: 278 [2024-11-12 05:28:54,511 INFO L226 Difference]: Without dead ends: 188 [2024-11-12 05:28:54,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:28:54,512 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 28 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:54,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 94 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:28:54,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-12 05:28:54,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2024-11-12 05:28:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 145 states have (on average 1.2137931034482758) internal successors, (176), 145 states have internal predecessors, (176), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 05:28:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 246 transitions. [2024-11-12 05:28:54,532 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 246 transitions. Word has length 60 [2024-11-12 05:28:54,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:54,533 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 246 transitions. [2024-11-12 05:28:54,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 246 transitions. [2024-11-12 05:28:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-12 05:28:54,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:54,534 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:28:54,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 05:28:54,535 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:54,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:54,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1142102934, now seen corresponding path program 1 times [2024-11-12 05:28:54,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:54,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968847925] [2024-11-12 05:28:54,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:54,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-12 05:28:55,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:55,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968847925] [2024-11-12 05:28:55,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968847925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:55,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:55,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 05:28:55,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457603067] [2024-11-12 05:28:55,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:55,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 05:28:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:55,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 05:28:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 05:28:55,257 INFO L87 Difference]: Start difference. First operand 186 states and 246 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:55,477 INFO L93 Difference]: Finished difference Result 340 states and 444 transitions. [2024-11-12 05:28:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:28:55,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2024-11-12 05:28:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:55,479 INFO L225 Difference]: With dead ends: 340 [2024-11-12 05:28:55,480 INFO L226 Difference]: Without dead ends: 262 [2024-11-12 05:28:55,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:28:55,481 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 95 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:55,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 161 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:28:55,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-12 05:28:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 203. [2024-11-12 05:28:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 162 states have (on average 1.2222222222222223) internal successors, (198), 162 states have internal predecessors, (198), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 05:28:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 268 transitions. [2024-11-12 05:28:55,510 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 268 transitions. Word has length 61 [2024-11-12 05:28:55,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:55,512 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 268 transitions. [2024-11-12 05:28:55,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 268 transitions. [2024-11-12 05:28:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-12 05:28:55,514 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:55,515 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:28:55,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 05:28:55,515 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:55,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:55,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1400268372, now seen corresponding path program 1 times [2024-11-12 05:28:55,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:55,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493736778] [2024-11-12 05:28:55,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:55,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-12 05:28:55,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:55,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493736778] [2024-11-12 05:28:55,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493736778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:55,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:55,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:28:55,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445026423] [2024-11-12 05:28:55,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:55,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:28:55,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:55,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:28:55,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:28:55,573 INFO L87 Difference]: Start difference. First operand 203 states and 268 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:55,616 INFO L93 Difference]: Finished difference Result 342 states and 452 transitions. [2024-11-12 05:28:55,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:28:55,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2024-11-12 05:28:55,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:55,618 INFO L225 Difference]: With dead ends: 342 [2024-11-12 05:28:55,619 INFO L226 Difference]: Without dead ends: 161 [2024-11-12 05:28:55,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:28:55,620 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:55,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:28:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-12 05:28:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2024-11-12 05:28:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 114 states have (on average 1.1754385964912282) internal successors, (134), 114 states have internal predecessors, (134), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 05:28:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2024-11-12 05:28:55,635 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 61 [2024-11-12 05:28:55,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:55,635 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2024-11-12 05:28:55,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2024-11-12 05:28:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-12 05:28:55,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:55,637 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:28:55,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 05:28:55,637 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:55,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:55,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1909669513, now seen corresponding path program 1 times [2024-11-12 05:28:55,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:55,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686065188] [2024-11-12 05:28:55,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:55,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:56,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:56,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-12 05:28:56,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:56,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686065188] [2024-11-12 05:28:56,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686065188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:56,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:56,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 05:28:56,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757009845] [2024-11-12 05:28:56,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:56,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 05:28:56,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:56,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 05:28:56,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-12 05:28:56,336 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:57,161 INFO L93 Difference]: Finished difference Result 240 states and 304 transitions. [2024-11-12 05:28:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 05:28:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2024-11-12 05:28:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:57,164 INFO L225 Difference]: With dead ends: 240 [2024-11-12 05:28:57,164 INFO L226 Difference]: Without dead ends: 238 [2024-11-12 05:28:57,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2024-11-12 05:28:57,166 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 232 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:57,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 454 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 05:28:57,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-12 05:28:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 163. [2024-11-12 05:28:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 130 states have internal predecessors, (152), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 05:28:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 208 transitions. [2024-11-12 05:28:57,190 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 208 transitions. Word has length 63 [2024-11-12 05:28:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:57,190 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 208 transitions. [2024-11-12 05:28:57,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 208 transitions. [2024-11-12 05:28:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 05:28:57,192 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:57,192 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:28:57,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 05:28:57,192 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:57,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1196751867, now seen corresponding path program 1 times [2024-11-12 05:28:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:57,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632812647] [2024-11-12 05:28:57,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:57,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:57,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:57,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:57,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:57,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:57,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:57,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:57,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-12 05:28:57,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:57,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632812647] [2024-11-12 05:28:57,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632812647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:57,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:57,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 05:28:57,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122380894] [2024-11-12 05:28:57,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:57,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 05:28:57,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:57,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 05:28:57,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:28:57,693 INFO L87 Difference]: Start difference. First operand 163 states and 208 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:57,914 INFO L93 Difference]: Finished difference Result 172 states and 217 transitions. [2024-11-12 05:28:57,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 05:28:57,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2024-11-12 05:28:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:57,916 INFO L225 Difference]: With dead ends: 172 [2024-11-12 05:28:57,916 INFO L226 Difference]: Without dead ends: 170 [2024-11-12 05:28:57,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-12 05:28:57,917 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 45 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:57,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 408 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:28:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-12 05:28:57,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2024-11-12 05:28:57,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 130 states have (on average 1.1615384615384616) internal successors, (151), 130 states have internal predecessors, (151), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 05:28:57,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 207 transitions. [2024-11-12 05:28:57,932 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 207 transitions. Word has length 64 [2024-11-12 05:28:57,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:57,933 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 207 transitions. [2024-11-12 05:28:57,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:28:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 207 transitions. [2024-11-12 05:28:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 05:28:57,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:57,934 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1] [2024-11-12 05:28:57,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 05:28:57,934 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:57,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:57,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2043906925, now seen corresponding path program 1 times [2024-11-12 05:28:57,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:57,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821203734] [2024-11-12 05:28:57,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:57,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:28:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 05:28:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:28:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:28:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:28:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:28:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:28:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 05:28:58,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:58,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821203734] [2024-11-12 05:28:58,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821203734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:28:58,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924557365] [2024-11-12 05:28:58,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:58,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:28:58,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:28:58,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:28:58,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:28:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 05:28:58,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:28:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 218 proven. 4 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-12 05:28:59,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:29:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 05:29:04,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924557365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:29:04,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:29:04,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 26 [2024-11-12 05:29:04,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754725352] [2024-11-12 05:29:04,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:29:04,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 05:29:04,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:29:04,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 05:29:04,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2024-11-12 05:29:04,584 INFO L87 Difference]: Start difference. First operand 163 states and 207 transitions. Second operand has 26 states, 26 states have (on average 4.846153846153846) internal successors, (126), 26 states have internal predecessors, (126), 5 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-11-12 05:29:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:29:12,201 INFO L93 Difference]: Finished difference Result 738 states and 918 transitions. [2024-11-12 05:29:12,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-12 05:29:12,202 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.846153846153846) internal successors, (126), 26 states have internal predecessors, (126), 5 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) Word has length 118 [2024-11-12 05:29:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:29:12,205 INFO L225 Difference]: With dead ends: 738 [2024-11-12 05:29:12,205 INFO L226 Difference]: Without dead ends: 635 [2024-11-12 05:29:12,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1998 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1336, Invalid=4066, Unknown=0, NotChecked=0, Total=5402 [2024-11-12 05:29:12,208 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 957 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:29:12,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1357 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 05:29:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-12 05:29:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 399. [2024-11-12 05:29:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 310 states have (on average 1.1580645161290322) internal successors, (359), 310 states have internal predecessors, (359), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-12 05:29:12,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 513 transitions. [2024-11-12 05:29:12,260 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 513 transitions. Word has length 118 [2024-11-12 05:29:12,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:29:12,260 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 513 transitions. [2024-11-12 05:29:12,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.846153846153846) internal successors, (126), 26 states have internal predecessors, (126), 5 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-11-12 05:29:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 513 transitions. [2024-11-12 05:29:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 05:29:12,262 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:29:12,262 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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-12 05:29:12,279 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-12 05:29:12,467 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,SelfDestructingSolverStorable11 [2024-11-12 05:29:12,468 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:29:12,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:29:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1382792067, now seen corresponding path program 1 times [2024-11-12 05:29:12,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:29:12,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723744878] [2024-11-12 05:29:12,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:29:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:29:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:29:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:29:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:29:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:29:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:29:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:29:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:29:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 05:29:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:29:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:29:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:29:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:29:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:29:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 05:29:13,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:29:13,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723744878] [2024-11-12 05:29:13,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723744878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:29:13,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957978290] [2024-11-12 05:29:13,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:13,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:29:13,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:29:13,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:29:13,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 05:29:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:14,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 05:29:14,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:29:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-12 05:29:14,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:29:14,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957978290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:29:14,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 05:29:14,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 15 [2024-11-12 05:29:14,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716703647] [2024-11-12 05:29:14,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:29:14,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:29:14,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:29:14,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:29:14,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-12 05:29:14,724 INFO L87 Difference]: Start difference. First operand 399 states and 513 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:29:14,888 INFO L93 Difference]: Finished difference Result 728 states and 935 transitions. [2024-11-12 05:29:14,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:29:14,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 119 [2024-11-12 05:29:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:29:14,892 INFO L225 Difference]: With dead ends: 728 [2024-11-12 05:29:14,892 INFO L226 Difference]: Without dead ends: 481 [2024-11-12 05:29:14,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-12 05:29:14,894 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 49 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:29:14,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 159 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:29:14,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-12 05:29:14,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 390. [2024-11-12 05:29:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 301 states have (on average 1.1561461794019934) internal successors, (348), 301 states have internal predecessors, (348), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-12 05:29:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 502 transitions. [2024-11-12 05:29:14,935 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 502 transitions. Word has length 119 [2024-11-12 05:29:14,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:29:14,936 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 502 transitions. [2024-11-12 05:29:14,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 502 transitions. [2024-11-12 05:29:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 05:29:14,938 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:29:14,938 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1] [2024-11-12 05:29:14,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 05:29:15,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-12 05:29:15,139 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:29:15,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:29:15,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1018602839, now seen corresponding path program 1 times [2024-11-12 05:29:15,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:29:15,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519517072] [2024-11-12 05:29:15,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:15,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:29:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:29:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:29:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:29:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:29:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:29:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:29:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:29:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:29:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:29:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:29:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:29:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:29:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:29:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 05:29:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-12 05:29:15,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:29:15,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519517072] [2024-11-12 05:29:15,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519517072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:29:15,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:29:15,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 05:29:15,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705769914] [2024-11-12 05:29:15,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:29:15,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:29:15,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:29:15,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:29:15,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:29:15,648 INFO L87 Difference]: Start difference. First operand 390 states and 502 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:29:15,801 INFO L93 Difference]: Finished difference Result 575 states and 733 transitions. [2024-11-12 05:29:15,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 05:29:15,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 120 [2024-11-12 05:29:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:29:15,804 INFO L225 Difference]: With dead ends: 575 [2024-11-12 05:29:15,804 INFO L226 Difference]: Without dead ends: 426 [2024-11-12 05:29:15,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:29:15,807 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 72 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:29:15,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 179 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:29:15,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-12 05:29:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 362. [2024-11-12 05:29:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 281 states have (on average 1.1423487544483986) internal successors, (321), 281 states have internal predecessors, (321), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 05:29:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 461 transitions. [2024-11-12 05:29:15,844 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 461 transitions. Word has length 120 [2024-11-12 05:29:15,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:29:15,844 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 461 transitions. [2024-11-12 05:29:15,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 461 transitions. [2024-11-12 05:29:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-12 05:29:15,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:29:15,847 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1] [2024-11-12 05:29:15,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 05:29:15,847 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:29:15,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:29:15,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1192519635, now seen corresponding path program 1 times [2024-11-12 05:29:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:29:15,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999856326] [2024-11-12 05:29:15,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:29:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:29:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:29:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:29:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:29:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:29:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:29:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:29:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:29:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:29:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:29:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:29:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:29:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:29:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 05:29:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 05:29:17,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:29:17,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999856326] [2024-11-12 05:29:17,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999856326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:29:17,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528530324] [2024-11-12 05:29:17,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:17,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:29:17,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:29:17,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:29:17,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 05:29:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:17,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 05:29:17,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:29:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-12 05:29:18,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:29:18,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528530324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:29:18,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 05:29:18,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 14 [2024-11-12 05:29:18,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024303935] [2024-11-12 05:29:18,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:29:18,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 05:29:18,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:29:18,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 05:29:18,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-12 05:29:18,675 INFO L87 Difference]: Start difference. First operand 362 states and 461 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:29:18,824 INFO L93 Difference]: Finished difference Result 541 states and 683 transitions. [2024-11-12 05:29:18,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:29:18,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 121 [2024-11-12 05:29:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:29:18,827 INFO L225 Difference]: With dead ends: 541 [2024-11-12 05:29:18,828 INFO L226 Difference]: Without dead ends: 424 [2024-11-12 05:29:18,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-12 05:29:18,831 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 39 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:29:18,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 166 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:29:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-12 05:29:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 357. [2024-11-12 05:29:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 276 states have (on average 1.1340579710144927) internal successors, (313), 276 states have internal predecessors, (313), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 05:29:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 453 transitions. [2024-11-12 05:29:18,866 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 453 transitions. Word has length 121 [2024-11-12 05:29:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:29:18,866 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 453 transitions. [2024-11-12 05:29:18,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 453 transitions. [2024-11-12 05:29:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 05:29:18,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:29:18,868 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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] [2024-11-12 05:29:18,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 05:29:19,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:29:19,069 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:29:19,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:29:19,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1028671250, now seen corresponding path program 1 times [2024-11-12 05:29:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:29:19,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407956058] [2024-11-12 05:29:19,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:19,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:29:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:29:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:29:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:29:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:29:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:29:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:29:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:29:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:29:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 05:29:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:29:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:29:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:29:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:29:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:29:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 05:29:20,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:29:20,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407956058] [2024-11-12 05:29:20,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407956058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:29:20,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623142047] [2024-11-12 05:29:20,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:20,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:29:20,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:29:20,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:29:20,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 05:29:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:20,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 05:29:20,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:29:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-12 05:29:21,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:29:21,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623142047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:29:21,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 05:29:21,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2024-11-12 05:29:21,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969947239] [2024-11-12 05:29:21,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:29:21,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 05:29:21,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:29:21,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 05:29:21,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2024-11-12 05:29:21,677 INFO L87 Difference]: Start difference. First operand 357 states and 453 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:29:22,098 INFO L93 Difference]: Finished difference Result 532 states and 673 transitions. [2024-11-12 05:29:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 05:29:22,098 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 122 [2024-11-12 05:29:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:29:22,102 INFO L225 Difference]: With dead ends: 532 [2024-11-12 05:29:22,102 INFO L226 Difference]: Without dead ends: 530 [2024-11-12 05:29:22,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2024-11-12 05:29:22,104 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 106 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:29:22,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 432 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:29:22,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-12 05:29:22,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 399. [2024-11-12 05:29:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 318 states have (on average 1.1320754716981132) internal successors, (360), 318 states have internal predecessors, (360), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 05:29:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 500 transitions. [2024-11-12 05:29:22,158 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 500 transitions. Word has length 122 [2024-11-12 05:29:22,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:29:22,158 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 500 transitions. [2024-11-12 05:29:22,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:22,158 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 500 transitions. [2024-11-12 05:29:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 05:29:22,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:29:22,160 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1] [2024-11-12 05:29:22,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 05:29:22,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-12 05:29:22,361 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:29:22,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:29:22,361 INFO L85 PathProgramCache]: Analyzing trace with hash -458937852, now seen corresponding path program 1 times [2024-11-12 05:29:22,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:29:22,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58405055] [2024-11-12 05:29:22,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:22,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:29:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:29:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:29:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:29:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:29:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:29:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:29:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:29:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:29:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:29:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:29:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:29:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:29:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:29:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 05:29:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 05:29:23,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:29:23,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58405055] [2024-11-12 05:29:23,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58405055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:29:23,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253720752] [2024-11-12 05:29:23,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:23,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:29:23,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:29:23,139 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:29:23,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 05:29:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:23,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 05:29:23,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:29:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-12 05:29:23,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:29:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-12 05:29:23,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253720752] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 05:29:23,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-12 05:29:23,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 20 [2024-11-12 05:29:23,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669746534] [2024-11-12 05:29:23,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:29:23,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:29:23,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:29:23,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:29:23,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-11-12 05:29:23,693 INFO L87 Difference]: Start difference. First operand 399 states and 500 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:29:23,989 INFO L93 Difference]: Finished difference Result 658 states and 817 transitions. [2024-11-12 05:29:23,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 05:29:23,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 122 [2024-11-12 05:29:23,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:29:23,993 INFO L225 Difference]: With dead ends: 658 [2024-11-12 05:29:23,994 INFO L226 Difference]: Without dead ends: 656 [2024-11-12 05:29:23,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-12 05:29:23,995 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 38 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:29:23,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 377 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:29:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-11-12 05:29:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 407. [2024-11-12 05:29:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 326 states have (on average 1.1319018404907975) internal successors, (369), 326 states have internal predecessors, (369), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 05:29:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 509 transitions. [2024-11-12 05:29:24,052 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 509 transitions. Word has length 122 [2024-11-12 05:29:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:29:24,052 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 509 transitions. [2024-11-12 05:29:24,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 509 transitions. [2024-11-12 05:29:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 05:29:24,054 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:29:24,054 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1] [2024-11-12 05:29:24,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-12 05:29:24,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-12 05:29:24,256 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:29:24,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:29:24,257 INFO L85 PathProgramCache]: Analyzing trace with hash -851964862, now seen corresponding path program 1 times [2024-11-12 05:29:24,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:29:24,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448825476] [2024-11-12 05:29:24,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:24,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:29:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:29:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:29:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:29:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:29:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:29:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:29:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:29:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:29:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:29:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:29:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:29:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:29:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:29:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 05:29:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-11-12 05:29:24,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:29:24,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448825476] [2024-11-12 05:29:24,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448825476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:29:24,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:29:24,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:29:24,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117668843] [2024-11-12 05:29:24,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:29:24,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:29:24,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:29:24,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:29:24,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:29:24,339 INFO L87 Difference]: Start difference. First operand 407 states and 509 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:24,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:29:24,391 INFO L93 Difference]: Finished difference Result 544 states and 682 transitions. [2024-11-12 05:29:24,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:29:24,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 122 [2024-11-12 05:29:24,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:29:24,395 INFO L225 Difference]: With dead ends: 544 [2024-11-12 05:29:24,395 INFO L226 Difference]: Without dead ends: 395 [2024-11-12 05:29:24,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:29:24,396 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:29:24,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:29:24,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-12 05:29:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-12 05:29:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 314 states have (on average 1.1210191082802548) internal successors, (352), 314 states have internal predecessors, (352), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 05:29:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 492 transitions. [2024-11-12 05:29:24,438 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 492 transitions. Word has length 122 [2024-11-12 05:29:24,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:29:24,438 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 492 transitions. [2024-11-12 05:29:24,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 492 transitions. [2024-11-12 05:29:24,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-12 05:29:24,440 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:29:24,440 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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] [2024-11-12 05:29:24,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 05:29:24,441 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:29:24,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:29:24,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1998321160, now seen corresponding path program 1 times [2024-11-12 05:29:24,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:29:24,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520052845] [2024-11-12 05:29:24,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:24,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:29:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:29:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:29:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:29:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:29:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:29:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:29:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:29:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:29:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 05:29:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:29:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:29:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:29:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:29:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:29:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-12 05:29:26,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:29:26,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520052845] [2024-11-12 05:29:26,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520052845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:29:26,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327115582] [2024-11-12 05:29:26,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:26,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:29:26,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:29:26,447 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:29:26,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 05:29:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:26,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 05:29:26,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:29:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-12 05:29:26,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:29:26,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327115582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:29:26,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 05:29:26,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 24 [2024-11-12 05:29:26,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731121132] [2024-11-12 05:29:26,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:29:26,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 05:29:26,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:29:26,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 05:29:26,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-12 05:29:26,904 INFO L87 Difference]: Start difference. First operand 395 states and 492 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:27,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:29:27,152 INFO L93 Difference]: Finished difference Result 650 states and 816 transitions. [2024-11-12 05:29:27,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 05:29:27,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 123 [2024-11-12 05:29:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:29:27,157 INFO L225 Difference]: With dead ends: 650 [2024-11-12 05:29:27,157 INFO L226 Difference]: Without dead ends: 648 [2024-11-12 05:29:27,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2024-11-12 05:29:27,158 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 81 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:29:27,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 467 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:29:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-12 05:29:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 392. [2024-11-12 05:29:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 311 states have (on average 1.1189710610932475) internal successors, (348), 311 states have internal predecessors, (348), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 05:29:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 488 transitions. [2024-11-12 05:29:27,212 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 488 transitions. Word has length 123 [2024-11-12 05:29:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:29:27,213 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 488 transitions. [2024-11-12 05:29:27,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:27,213 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 488 transitions. [2024-11-12 05:29:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-12 05:29:27,214 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:29:27,215 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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-12 05:29:27,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 05:29:27,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:29:27,420 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:29:27,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:29:27,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1297256582, now seen corresponding path program 1 times [2024-11-12 05:29:27,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:29:27,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463380814] [2024-11-12 05:29:27,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:27,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:29:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:29:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:29:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:29:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:29:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:29:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:29:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:29:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:29:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 05:29:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:29:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:29:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:29:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:29:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:29:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-12 05:29:28,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:29:28,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463380814] [2024-11-12 05:29:28,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463380814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:29:28,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061070460] [2024-11-12 05:29:28,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:28,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:29:28,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:29:28,743 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:29:28,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 05:29:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:28,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 05:29:28,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:29:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-12 05:29:30,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:29:30,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061070460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:29:30,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 05:29:30,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 21 [2024-11-12 05:29:30,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709629914] [2024-11-12 05:29:30,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:29:30,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 05:29:30,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:29:30,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 05:29:30,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2024-11-12 05:29:30,552 INFO L87 Difference]: Start difference. First operand 392 states and 488 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:29:30,978 INFO L93 Difference]: Finished difference Result 559 states and 689 transitions. [2024-11-12 05:29:30,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 05:29:30,979 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 123 [2024-11-12 05:29:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:29:30,982 INFO L225 Difference]: With dead ends: 559 [2024-11-12 05:29:30,982 INFO L226 Difference]: Without dead ends: 557 [2024-11-12 05:29:30,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2024-11-12 05:29:30,983 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 52 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:29:30,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 665 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:29:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-12 05:29:31,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 336. [2024-11-12 05:29:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 263 states have (on average 1.1102661596958174) internal successors, (292), 263 states have internal predecessors, (292), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-12 05:29:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 418 transitions. [2024-11-12 05:29:31,035 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 418 transitions. Word has length 123 [2024-11-12 05:29:31,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:29:31,036 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 418 transitions. [2024-11-12 05:29:31,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:31,037 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 418 transitions. [2024-11-12 05:29:31,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-12 05:29:31,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:29:31,038 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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] [2024-11-12 05:29:31,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-12 05:29:31,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:29:31,239 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:29:31,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:29:31,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1138777084, now seen corresponding path program 1 times [2024-11-12 05:29:31,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:29:31,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575507540] [2024-11-12 05:29:31,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:31,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:29:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:29:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:29:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:29:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:29:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:29:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:29:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:29:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:29:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:29:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:29:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:29:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:29:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:29:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 05:29:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-12 05:29:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:29:31,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575507540] [2024-11-12 05:29:31,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575507540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:29:31,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:29:31,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 05:29:31,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292966582] [2024-11-12 05:29:31,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:29:31,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 05:29:31,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:29:31,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 05:29:31,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:29:31,866 INFO L87 Difference]: Start difference. First operand 336 states and 418 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:29:32,475 INFO L93 Difference]: Finished difference Result 512 states and 645 transitions. [2024-11-12 05:29:32,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 05:29:32,475 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 124 [2024-11-12 05:29:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:29:32,476 INFO L225 Difference]: With dead ends: 512 [2024-11-12 05:29:32,476 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 05:29:32,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2024-11-12 05:29:32,478 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 150 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:29:32,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 419 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:29:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 05:29:32,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 05:29:32,480 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-12 05:29:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 05:29:32,480 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2024-11-12 05:29:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:29:32,481 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 05:29:32,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-12 05:29:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 05:29:32,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 05:29:32,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:29:32,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 05:29:32,488 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:29:32,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 05:29:46,874 WARN L286 SmtUtils]: Spent 13.06s on a formula simplification. DAG size of input: 325 DAG size of output: 111 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-12 05:29:49,987 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:29:50,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:29:50 BoogieIcfgContainer [2024-11-12 05:29:50,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:29:50,036 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:29:50,038 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:29:50,038 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:29:50,038 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:28:49" (3/4) ... [2024-11-12 05:29:50,041 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 05:29:50,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 05:29:50,052 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-12 05:29:50,052 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 05:29:50,053 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 05:29:50,053 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 05:29:50,161 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 05:29:50,161 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 05:29:50,161 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:29:50,162 INFO L158 Benchmark]: Toolchain (without parser) took 61129.36ms. Allocated memory was 176.2MB in the beginning and 926.9MB in the end (delta: 750.8MB). Free memory was 117.3MB in the beginning and 459.7MB in the end (delta: -342.3MB). Peak memory consumption was 411.5MB. Max. memory is 16.1GB. [2024-11-12 05:29:50,162 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:29:50,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.73ms. Allocated memory is still 176.2MB. Free memory was 117.3MB in the beginning and 102.2MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 05:29:50,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.62ms. Allocated memory is still 176.2MB. Free memory was 102.2MB in the beginning and 99.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:29:50,166 INFO L158 Benchmark]: Boogie Preprocessor took 54.03ms. Allocated memory is still 176.2MB. Free memory was 99.7MB in the beginning and 96.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:29:50,166 INFO L158 Benchmark]: RCFGBuilder took 454.15ms. Allocated memory is still 176.2MB. Free memory was 96.8MB in the beginning and 80.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 05:29:50,166 INFO L158 Benchmark]: TraceAbstraction took 60080.38ms. Allocated memory was 176.2MB in the beginning and 926.9MB in the end (delta: 750.8MB). Free memory was 79.6MB in the beginning and 466.0MB in the end (delta: -386.4MB). Peak memory consumption was 497.6MB. Max. memory is 16.1GB. [2024-11-12 05:29:50,167 INFO L158 Benchmark]: Witness Printer took 125.57ms. Allocated memory is still 926.9MB. Free memory was 466.0MB in the beginning and 459.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 05:29:50,168 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.18ms. Allocated memory is still 176.2MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.73ms. Allocated memory is still 176.2MB. Free memory was 117.3MB in the beginning and 102.2MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.62ms. Allocated memory is still 176.2MB. Free memory was 102.2MB in the beginning and 99.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.03ms. Allocated memory is still 176.2MB. Free memory was 99.7MB in the beginning and 96.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 454.15ms. Allocated memory is still 176.2MB. Free memory was 96.8MB in the beginning and 80.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 60080.38ms. Allocated memory was 176.2MB in the beginning and 926.9MB in the end (delta: 750.8MB). Free memory was 79.6MB in the beginning and 466.0MB in the end (delta: -386.4MB). Peak memory consumption was 497.6MB. Max. memory is 16.1GB. * Witness Printer took 125.57ms. Allocated memory is still 926.9MB. Free memory was 466.0MB in the beginning and 459.7MB 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, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.5s, OverallIterations: 21, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2373 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2373 mSDsluCounter, 6567 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5175 mSDsCounter, 524 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3991 IncrementalHoareTripleChecker+Invalid, 4515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 524 mSolverCounterUnsat, 1392 mSDtfsCounter, 3991 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1829 GetRequests, 1536 SyntacticMatches, 4 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2764 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=17, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 1767 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 25.8s InterpolantComputationTime, 2724 NumberOfCodeBlocks, 2724 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2934 ConstructedInterpolants, 0 QuantifiedInterpolants, 19204 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1873 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 30 InterpolantComputations, 20 PerfectInterpolantSequences, 8164/8382 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: 86]: Loop Invariant Derived loop invariant: (((var_1_11 != var_1_5) || (var_1_1 != 0)) || ((((long long) 65520 + var_1_11) % 65536) != 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((var_1_1 != 0) || (((var_1_11 != var_1_5) || ((((long long) 65520 + var_1_11) % 65536) != 0)) && ((last_1_var_1_11 != last_1_var_1_5) || ((((long long) 65520 + last_1_var_1_11) % 65536) != 0)))) Ensures: (((var_1_1 != 0) || (((var_1_11 != var_1_5) || ((((long long) 65520 + var_1_11) % 65536) != 0)) && ((last_1_var_1_11 != last_1_var_1_5) || ((((long long) 65520 + last_1_var_1_11) % 65536) != 0)))) && ((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (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))) && (last_1_var_1_5 == \old(last_1_var_1_5))) && (last_1_var_1_11 == \old(last_1_var_1_11)))) RESULT: Ultimate proved your program to be correct! [2024-11-12 05:29:50,210 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