./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label12.c --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/eca-rers2012/Problem11_label12.c -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 ffbcc3b4e73f8ad55a0649493c69e3be3f48518c4d71790476a2cf0516dec892 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:48:38,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:48:38,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:48:38,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:48:38,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:48:38,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:48:38,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:48:38,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:48:38,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:48:38,678 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:48:38,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:48:38,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:48:38,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:48:38,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:48:38,680 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:48:38,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:48:38,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:48:38,681 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:48:38,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:48:38,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:48:38,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:48:38,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:48:38,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:48:38,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:48:38,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:48:38,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:48:38,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:48:38,684 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:48:38,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:48:38,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:48:38,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:48:38,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:48:38,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:48:38,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:48:38,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:48:38,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:48:38,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:48:38,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:48:38,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:48:38,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:48:38,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:48:38,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:48:38,688 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 -> ffbcc3b4e73f8ad55a0649493c69e3be3f48518c4d71790476a2cf0516dec892 [2024-11-11 16:48:38,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:48:38,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:48:38,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:48:38,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:48:38,944 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:48:38,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label12.c [2024-11-11 16:48:40,371 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:48:40,656 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:48:40,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label12.c [2024-11-11 16:48:40,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9828960cf/67db05ba49284d55beec0b67b98324ed/FLAG86f46861f [2024-11-11 16:48:40,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9828960cf/67db05ba49284d55beec0b67b98324ed [2024-11-11 16:48:40,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:48:40,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:48:40,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:48:40,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:48:40,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:48:40,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:48:40" (1/1) ... [2024-11-11 16:48:40,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58001a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:40, skipping insertion in model container [2024-11-11 16:48:40,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:48:40" (1/1) ... [2024-11-11 16:48:40,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:48:41,027 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/eca-rers2012/Problem11_label12.c[3684,3697] [2024-11-11 16:48:41,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:48:41,266 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:48:41,287 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/eca-rers2012/Problem11_label12.c[3684,3697] [2024-11-11 16:48:41,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:48:41,439 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:48:41,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:41 WrapperNode [2024-11-11 16:48:41,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:48:41,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:48:41,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:48:41,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:48:41,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:41" (1/1) ... [2024-11-11 16:48:41,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:41" (1/1) ... [2024-11-11 16:48:41,590 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-11 16:48:41,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:48:41,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:48:41,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:48:41,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:48:41,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:41" (1/1) ... [2024-11-11 16:48:41,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:41" (1/1) ... [2024-11-11 16:48:41,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:41" (1/1) ... [2024-11-11 16:48:41,661 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-11 16:48:41,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:41" (1/1) ... [2024-11-11 16:48:41,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:41" (1/1) ... [2024-11-11 16:48:41,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:41" (1/1) ... [2024-11-11 16:48:41,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:41" (1/1) ... [2024-11-11 16:48:41,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:41" (1/1) ... [2024-11-11 16:48:41,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:41" (1/1) ... [2024-11-11 16:48:41,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:48:41,775 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:48:41,775 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:48:41,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:48:41,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:41" (1/1) ... [2024-11-11 16:48:41,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:48:41,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:48:41,811 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-11 16:48:41,818 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-11 16:48:41,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:48:41,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:48:41,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:48:41,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:48:41,926 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:48:41,927 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:48:43,564 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-11 16:48:43,565 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:48:43,592 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:48:43,593 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:48:43,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:48:43 BoogieIcfgContainer [2024-11-11 16:48:43,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:48:43,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:48:43,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:48:43,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:48:43,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:48:40" (1/3) ... [2024-11-11 16:48:43,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643c0480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:48:43, skipping insertion in model container [2024-11-11 16:48:43,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:41" (2/3) ... [2024-11-11 16:48:43,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643c0480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:48:43, skipping insertion in model container [2024-11-11 16:48:43,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:48:43" (3/3) ... [2024-11-11 16:48:43,604 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label12.c [2024-11-11 16:48:43,622 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:48:43,623 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:48:43,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:48:43,708 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;@360a3923, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:48:43,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:48:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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-11 16:48:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 16:48:43,723 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:43,725 INFO L218 NwaCegarLoop]: trace histogram [1, 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-11 16:48:43,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:43,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:43,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1225036359, now seen corresponding path program 1 times [2024-11-11 16:48:43,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:43,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467672999] [2024-11-11 16:48:43,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:43,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:44,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:44,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467672999] [2024-11-11 16:48:44,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467672999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:44,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:44,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:48:44,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850062513] [2024-11-11 16:48:44,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:44,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:44,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:44,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:44,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:44,070 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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-11 16:48:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:45,128 INFO L93 Difference]: Finished difference Result 769 states and 1360 transitions. [2024-11-11 16:48:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:45,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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) Word has length 25 [2024-11-11 16:48:45,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:45,144 INFO L225 Difference]: With dead ends: 769 [2024-11-11 16:48:45,145 INFO L226 Difference]: Without dead ends: 422 [2024-11-11 16:48:45,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 16:48:45,151 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 215 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:45,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 163 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:48:45,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-11 16:48:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2024-11-11 16:48:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 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-11 16:48:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2024-11-11 16:48:45,247 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 25 [2024-11-11 16:48:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:45,248 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2024-11-11 16:48:45,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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-11 16:48:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2024-11-11 16:48:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-11 16:48:45,251 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:45,252 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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-11 16:48:45,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:48:45,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:45,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:45,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1252337339, now seen corresponding path program 1 times [2024-11-11 16:48:45,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:45,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960216998] [2024-11-11 16:48:45,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:45,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:45,417 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:45,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:45,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960216998] [2024-11-11 16:48:45,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960216998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:45,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:45,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:48:45,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096995064] [2024-11-11 16:48:45,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:45,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:45,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:45,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:45,422 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-11 16:48:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:46,069 INFO L93 Difference]: Finished difference Result 1194 states and 1821 transitions. [2024-11-11 16:48:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:46,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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) Word has length 91 [2024-11-11 16:48:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:46,075 INFO L225 Difference]: With dead ends: 1194 [2024-11-11 16:48:46,075 INFO L226 Difference]: Without dead ends: 784 [2024-11-11 16:48:46,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 16:48:46,080 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 175 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:46,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 154 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-11 16:48:46,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2024-11-11 16:48:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 1.3742017879948913) internal successors, (1076), 783 states have internal predecessors, (1076), 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-11 16:48:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1076 transitions. [2024-11-11 16:48:46,115 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1076 transitions. Word has length 91 [2024-11-11 16:48:46,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:46,115 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1076 transitions. [2024-11-11 16:48:46,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-11 16:48:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1076 transitions. [2024-11-11 16:48:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-11 16:48:46,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:46,118 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:48:46,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:48:46,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:46,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:46,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1061626683, now seen corresponding path program 1 times [2024-11-11 16:48:46,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:46,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418392282] [2024-11-11 16:48:46,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:46,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:46,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:46,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418392282] [2024-11-11 16:48:46,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418392282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:46,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:46,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:48:46,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416089628] [2024-11-11 16:48:46,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:46,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:46,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:46,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:46,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:46,448 INFO L87 Difference]: Start difference. First operand 784 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-11 16:48:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:47,096 INFO L93 Difference]: Finished difference Result 1936 states and 2599 transitions. [2024-11-11 16:48:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:47,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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) Word has length 95 [2024-11-11 16:48:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:47,102 INFO L225 Difference]: With dead ends: 1936 [2024-11-11 16:48:47,102 INFO L226 Difference]: Without dead ends: 1154 [2024-11-11 16:48:47,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 16:48:47,107 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:47,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-11 16:48:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1153. [2024-11-11 16:48:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.2699652777777777) internal successors, (1463), 1152 states have internal predecessors, (1463), 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-11 16:48:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1463 transitions. [2024-11-11 16:48:47,136 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1463 transitions. Word has length 95 [2024-11-11 16:48:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:47,137 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1463 transitions. [2024-11-11 16:48:47,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-11 16:48:47,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1463 transitions. [2024-11-11 16:48:47,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-11 16:48:47,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:47,143 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:48:47,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:48:47,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:47,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:47,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2063439108, now seen corresponding path program 1 times [2024-11-11 16:48:47,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:47,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894898669] [2024-11-11 16:48:47,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:47,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 16:48:47,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:47,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894898669] [2024-11-11 16:48:47,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894898669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:47,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:47,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:48:47,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412567216] [2024-11-11 16:48:47,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:47,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:47,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:47,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:47,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:47,360 INFO L87 Difference]: Start difference. First operand 1153 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-11 16:48:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:48,082 INFO L93 Difference]: Finished difference Result 2494 states and 3189 transitions. [2024-11-11 16:48:48,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:48,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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) Word has length 137 [2024-11-11 16:48:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:48,089 INFO L225 Difference]: With dead ends: 2494 [2024-11-11 16:48:48,089 INFO L226 Difference]: Without dead ends: 1527 [2024-11-11 16:48:48,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 16:48:48,092 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 106 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:48,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 154 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:48:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2024-11-11 16:48:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2024-11-11 16:48:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.2557377049180327) internal successors, (1915), 1525 states have internal predecessors, (1915), 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-11 16:48:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1915 transitions. [2024-11-11 16:48:48,126 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1915 transitions. Word has length 137 [2024-11-11 16:48:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:48,127 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1915 transitions. [2024-11-11 16:48:48,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-11 16:48:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1915 transitions. [2024-11-11 16:48:48,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-11 16:48:48,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:48,130 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:48:48,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:48:48,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:48,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash 215435237, now seen corresponding path program 1 times [2024-11-11 16:48:48,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:48,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047951335] [2024-11-11 16:48:48,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:48,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:48,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:48,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047951335] [2024-11-11 16:48:48,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047951335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:48,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:48,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:48,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93648091] [2024-11-11 16:48:48,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:48,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:48,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:48,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:48,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:48,377 INFO L87 Difference]: Start difference. First operand 1526 states and 1915 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-11 16:48:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:49,105 INFO L93 Difference]: Finished difference Result 2864 states and 3636 transitions. [2024-11-11 16:48:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:49,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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) Word has length 152 [2024-11-11 16:48:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:49,112 INFO L225 Difference]: With dead ends: 2864 [2024-11-11 16:48:49,112 INFO L226 Difference]: Without dead ends: 1524 [2024-11-11 16:48:49,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 16:48:49,116 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 210 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:49,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 306 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:48:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-11-11 16:48:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1524. [2024-11-11 16:48:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1523 states have (on average 1.2107682206172028) internal successors, (1844), 1523 states have internal predecessors, (1844), 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-11 16:48:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1844 transitions. [2024-11-11 16:48:49,148 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1844 transitions. Word has length 152 [2024-11-11 16:48:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:49,149 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 1844 transitions. [2024-11-11 16:48:49,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-11 16:48:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1844 transitions. [2024-11-11 16:48:49,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-11 16:48:49,155 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:49,155 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 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-11 16:48:49,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:48:49,155 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:49,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash -422181944, now seen corresponding path program 1 times [2024-11-11 16:48:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:49,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971345540] [2024-11-11 16:48:49,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:49,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-11 16:48:49,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:49,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971345540] [2024-11-11 16:48:49,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971345540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:49,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:49,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:49,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842244334] [2024-11-11 16:48:49,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:49,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:49,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:49,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:49,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:49,444 INFO L87 Difference]: Start difference. First operand 1524 states and 1844 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-11 16:48:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:50,253 INFO L93 Difference]: Finished difference Result 3603 states and 4427 transitions. [2024-11-11 16:48:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:50,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) Word has length 207 [2024-11-11 16:48:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:50,266 INFO L225 Difference]: With dead ends: 3603 [2024-11-11 16:48:50,266 INFO L226 Difference]: Without dead ends: 2265 [2024-11-11 16:48:50,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 16:48:50,270 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 172 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:50,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 386 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:48:50,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2024-11-11 16:48:50,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2076. [2024-11-11 16:48:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 2075 states have (on average 1.192289156626506) internal successors, (2474), 2075 states have internal predecessors, (2474), 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-11 16:48:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2474 transitions. [2024-11-11 16:48:50,308 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2474 transitions. Word has length 207 [2024-11-11 16:48:50,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:50,312 INFO L471 AbstractCegarLoop]: Abstraction has 2076 states and 2474 transitions. [2024-11-11 16:48:50,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-11 16:48:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2474 transitions. [2024-11-11 16:48:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-11 16:48:50,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:50,315 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:50,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:48:50,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:50,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1594072215, now seen corresponding path program 1 times [2024-11-11 16:48:50,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:50,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525799885] [2024-11-11 16:48:50,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:50,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-11 16:48:50,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:50,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525799885] [2024-11-11 16:48:50,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525799885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:50,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:50,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:50,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425526136] [2024-11-11 16:48:50,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:50,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:50,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:50,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:50,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:50,551 INFO L87 Difference]: Start difference. First operand 2076 states and 2474 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-11 16:48:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:51,362 INFO L93 Difference]: Finished difference Result 4890 states and 5877 transitions. [2024-11-11 16:48:51,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:51,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) Word has length 213 [2024-11-11 16:48:51,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:51,375 INFO L225 Difference]: With dead ends: 4890 [2024-11-11 16:48:51,376 INFO L226 Difference]: Without dead ends: 2816 [2024-11-11 16:48:51,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 16:48:51,381 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 171 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:51,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 387 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:48:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2024-11-11 16:48:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2811. [2024-11-11 16:48:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2811 states, 2810 states have (on average 1.1736654804270463) internal successors, (3298), 2810 states have internal predecessors, (3298), 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-11 16:48:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2811 states and 3298 transitions. [2024-11-11 16:48:51,446 INFO L78 Accepts]: Start accepts. Automaton has 2811 states and 3298 transitions. Word has length 213 [2024-11-11 16:48:51,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:51,447 INFO L471 AbstractCegarLoop]: Abstraction has 2811 states and 3298 transitions. [2024-11-11 16:48:51,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-11 16:48:51,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2811 states and 3298 transitions. [2024-11-11 16:48:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-11 16:48:51,451 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:51,451 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:51,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:48:51,452 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:51,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:51,452 INFO L85 PathProgramCache]: Analyzing trace with hash -336607869, now seen corresponding path program 1 times [2024-11-11 16:48:51,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:51,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843956399] [2024-11-11 16:48:51,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:51,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:51,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:51,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843956399] [2024-11-11 16:48:51,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843956399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:51,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:51,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:51,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948375879] [2024-11-11 16:48:51,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:51,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:48:51,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:51,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:48:51,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:48:51,733 INFO L87 Difference]: Start difference. First operand 2811 states and 3298 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 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-11 16:48:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:53,049 INFO L93 Difference]: Finished difference Result 8956 states and 10588 transitions. [2024-11-11 16:48:53,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:48:53,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 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) Word has length 252 [2024-11-11 16:48:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:53,071 INFO L225 Difference]: With dead ends: 8956 [2024-11-11 16:48:53,072 INFO L226 Difference]: Without dead ends: 6147 [2024-11-11 16:48:53,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:48:53,078 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 284 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:53,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 78 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 16:48:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2024-11-11 16:48:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 5961. [2024-11-11 16:48:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5961 states, 5960 states have (on average 1.1758389261744966) internal successors, (7008), 5960 states have internal predecessors, (7008), 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-11 16:48:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5961 states to 5961 states and 7008 transitions. [2024-11-11 16:48:53,187 INFO L78 Accepts]: Start accepts. Automaton has 5961 states and 7008 transitions. Word has length 252 [2024-11-11 16:48:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:53,188 INFO L471 AbstractCegarLoop]: Abstraction has 5961 states and 7008 transitions. [2024-11-11 16:48:53,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 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-11 16:48:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5961 states and 7008 transitions. [2024-11-11 16:48:53,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-11 16:48:53,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:53,195 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:53,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:48:53,196 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:53,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash 400013300, now seen corresponding path program 1 times [2024-11-11 16:48:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46488859] [2024-11-11 16:48:53,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:53,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-11 16:48:53,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:53,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46488859] [2024-11-11 16:48:53,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46488859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:53,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:53,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:53,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030010244] [2024-11-11 16:48:53,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:53,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:53,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:53,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:53,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:53,435 INFO L87 Difference]: Start difference. First operand 5961 states and 7008 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-11 16:48:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:54,126 INFO L93 Difference]: Finished difference Result 12099 states and 14259 transitions. [2024-11-11 16:48:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:54,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) Word has length 290 [2024-11-11 16:48:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:54,152 INFO L225 Difference]: With dead ends: 12099 [2024-11-11 16:48:54,152 INFO L226 Difference]: Without dead ends: 7248 [2024-11-11 16:48:54,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 16:48:54,161 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 197 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:54,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 146 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7248 states. [2024-11-11 16:48:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7248 to 4664. [2024-11-11 16:48:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4664 states, 4663 states have (on average 1.1799270855672315) internal successors, (5502), 4663 states have internal predecessors, (5502), 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-11 16:48:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 5502 transitions. [2024-11-11 16:48:54,262 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 5502 transitions. Word has length 290 [2024-11-11 16:48:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:54,262 INFO L471 AbstractCegarLoop]: Abstraction has 4664 states and 5502 transitions. [2024-11-11 16:48:54,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-11 16:48:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 5502 transitions. [2024-11-11 16:48:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-11 16:48:54,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:54,269 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:48:54,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:48:54,270 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:54,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:54,270 INFO L85 PathProgramCache]: Analyzing trace with hash 441780138, now seen corresponding path program 1 times [2024-11-11 16:48:54,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:54,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895796589] [2024-11-11 16:48:54,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:54,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 113 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:54,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895796589] [2024-11-11 16:48:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895796589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:48:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961276540] [2024-11-11 16:48:54,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:54,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:48:54,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:48:54,875 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-11 16:48:54,877 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-11 16:48:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:55,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 16:48:55,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:48:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 113 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:56,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:48:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 113 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:58,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961276540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:48:58,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:48:58,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-11 16:48:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990220580] [2024-11-11 16:48:58,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:48:58,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 16:48:58,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:58,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 16:48:58,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:48:58,722 INFO L87 Difference]: Start difference. First operand 4664 states and 5502 transitions. Second operand has 8 states, 8 states have (on average 68.875) internal successors, (551), 7 states have internal predecessors, (551), 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-11 16:49:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:01,210 INFO L93 Difference]: Finished difference Result 12139 states and 14292 transitions. [2024-11-11 16:49:01,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 16:49:01,211 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 68.875) internal successors, (551), 7 states have internal predecessors, (551), 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) Word has length 299 [2024-11-11 16:49:01,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:01,235 INFO L225 Difference]: With dead ends: 12139 [2024-11-11 16:49:01,236 INFO L226 Difference]: Without dead ends: 7845 [2024-11-11 16:49:01,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-11 16:49:01,244 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 898 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 3144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:01,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 184 Invalid, 3144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 2790 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 16:49:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7845 states. [2024-11-11 16:49:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7845 to 4477. [2024-11-11 16:49:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4477 states, 4476 states have (on average 1.1735924932975872) internal successors, (5253), 4476 states have internal predecessors, (5253), 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-11 16:49:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 5253 transitions. [2024-11-11 16:49:01,339 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 5253 transitions. Word has length 299 [2024-11-11 16:49:01,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:01,340 INFO L471 AbstractCegarLoop]: Abstraction has 4477 states and 5253 transitions. [2024-11-11 16:49:01,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 68.875) internal successors, (551), 7 states have internal predecessors, (551), 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-11 16:49:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 5253 transitions. [2024-11-11 16:49:01,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-11-11 16:49:01,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:01,347 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:49:01,366 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-11 16:49:01,547 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,SelfDestructingSolverStorable9 [2024-11-11 16:49:01,548 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:01,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:01,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1087462780, now seen corresponding path program 1 times [2024-11-11 16:49:01,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:01,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068173682] [2024-11-11 16:49:01,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:01,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-11 16:49:01,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:01,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068173682] [2024-11-11 16:49:01,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068173682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:01,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:01,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:01,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549767964] [2024-11-11 16:49:01,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:01,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:01,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:01,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:01,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:01,941 INFO L87 Difference]: Start difference. First operand 4477 states and 5253 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-11 16:49:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:02,571 INFO L93 Difference]: Finished difference Result 11544 states and 13684 transitions. [2024-11-11 16:49:02,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:02,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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) Word has length 319 [2024-11-11 16:49:02,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:02,583 INFO L225 Difference]: With dead ends: 11544 [2024-11-11 16:49:02,583 INFO L226 Difference]: Without dead ends: 7437 [2024-11-11 16:49:02,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 16:49:02,590 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 135 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:02,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 147 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:02,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7437 states. [2024-11-11 16:49:02,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7437 to 7434. [2024-11-11 16:49:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7434 states, 7433 states have (on average 1.1590205838826853) internal successors, (8615), 7433 states have internal predecessors, (8615), 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-11 16:49:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7434 states to 7434 states and 8615 transitions. [2024-11-11 16:49:02,680 INFO L78 Accepts]: Start accepts. Automaton has 7434 states and 8615 transitions. Word has length 319 [2024-11-11 16:49:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:02,680 INFO L471 AbstractCegarLoop]: Abstraction has 7434 states and 8615 transitions. [2024-11-11 16:49:02,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-11 16:49:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 7434 states and 8615 transitions. [2024-11-11 16:49:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-11 16:49:02,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:02,690 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:02,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:49:02,690 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:02,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2117266511, now seen corresponding path program 1 times [2024-11-11 16:49:02,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:02,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420680516] [2024-11-11 16:49:02,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:02,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:03,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:03,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420680516] [2024-11-11 16:49:03,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420680516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:03,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:03,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:49:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242822213] [2024-11-11 16:49:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:03,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:49:03,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:03,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:49:03,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:03,058 INFO L87 Difference]: Start difference. First operand 7434 states and 8615 transitions. Second operand has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 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-11 16:49:04,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:04,087 INFO L93 Difference]: Finished difference Result 18556 states and 21601 transitions. [2024-11-11 16:49:04,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:49:04,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 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) Word has length 330 [2024-11-11 16:49:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:04,107 INFO L225 Difference]: With dead ends: 18556 [2024-11-11 16:49:04,107 INFO L226 Difference]: Without dead ends: 11492 [2024-11-11 16:49:04,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:04,116 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 278 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:04,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 61 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:49:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11492 states. [2024-11-11 16:49:04,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11492 to 10201. [2024-11-11 16:49:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10201 states, 10200 states have (on average 1.1384313725490196) internal successors, (11612), 10200 states have internal predecessors, (11612), 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-11 16:49:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10201 states to 10201 states and 11612 transitions. [2024-11-11 16:49:04,287 INFO L78 Accepts]: Start accepts. Automaton has 10201 states and 11612 transitions. Word has length 330 [2024-11-11 16:49:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:04,288 INFO L471 AbstractCegarLoop]: Abstraction has 10201 states and 11612 transitions. [2024-11-11 16:49:04,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 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-11 16:49:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 10201 states and 11612 transitions. [2024-11-11 16:49:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-11-11 16:49:04,303 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:04,305 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:49:04,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:49:04,305 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:04,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:04,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1773560037, now seen corresponding path program 1 times [2024-11-11 16:49:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431858018] [2024-11-11 16:49:04,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-11 16:49:04,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:04,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431858018] [2024-11-11 16:49:04,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431858018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:04,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:04,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:49:04,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942645444] [2024-11-11 16:49:04,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:04,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:49:04,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:04,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:49:04,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:04,788 INFO L87 Difference]: Start difference. First operand 10201 states and 11612 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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-11 16:49:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:05,777 INFO L93 Difference]: Finished difference Result 21875 states and 24945 transitions. [2024-11-11 16:49:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:49:05,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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) Word has length 404 [2024-11-11 16:49:05,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:05,797 INFO L225 Difference]: With dead ends: 21875 [2024-11-11 16:49:05,797 INFO L226 Difference]: Without dead ends: 12044 [2024-11-11 16:49:05,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:05,810 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 264 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:05,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 61 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 16:49:05,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12044 states. [2024-11-11 16:49:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12044 to 10201. [2024-11-11 16:49:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10201 states, 10200 states have (on average 1.1384313725490196) internal successors, (11612), 10200 states have internal predecessors, (11612), 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-11 16:49:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10201 states to 10201 states and 11612 transitions. [2024-11-11 16:49:05,950 INFO L78 Accepts]: Start accepts. Automaton has 10201 states and 11612 transitions. Word has length 404 [2024-11-11 16:49:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:05,950 INFO L471 AbstractCegarLoop]: Abstraction has 10201 states and 11612 transitions. [2024-11-11 16:49:05,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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-11 16:49:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 10201 states and 11612 transitions. [2024-11-11 16:49:05,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2024-11-11 16:49:05,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:05,968 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:05,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 16:49:05,969 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:05,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:05,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1078623225, now seen corresponding path program 1 times [2024-11-11 16:49:05,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:05,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658984663] [2024-11-11 16:49:05,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:05,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1192 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2024-11-11 16:49:06,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:06,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658984663] [2024-11-11 16:49:06,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658984663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:06,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:06,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:06,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808824674] [2024-11-11 16:49:06,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:06,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:06,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:06,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:06,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:06,469 INFO L87 Difference]: Start difference. First operand 10201 states and 11612 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-11 16:49:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:07,161 INFO L93 Difference]: Finished difference Result 21685 states and 24759 transitions. [2024-11-11 16:49:07,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:07,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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) Word has length 668 [2024-11-11 16:49:07,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:07,163 INFO L225 Difference]: With dead ends: 21685 [2024-11-11 16:49:07,163 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:49:07,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 16:49:07,178 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 194 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:07,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 363 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:49:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:49:07,179 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-11 16:49:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:49:07,179 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 668 [2024-11-11 16:49:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:07,180 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:49:07,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-11 16:49:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:49:07,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:49:07,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:49:07,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 16:49:07,188 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:07,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:49:08,775 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:49:08,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:49:08 BoogieIcfgContainer [2024-11-11 16:49:08,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:49:08,791 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:49:08,791 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:49:08,792 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:49:08,792 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:48:43" (3/4) ... [2024-11-11 16:49:08,794 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:49:08,815 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:49:08,816 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:49:08,817 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:49:08,818 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:49:08,991 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:49:08,991 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:49:08,991 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:49:08,992 INFO L158 Benchmark]: Toolchain (without parser) took 28287.11ms. Allocated memory was 127.9MB in the beginning and 677.4MB in the end (delta: 549.5MB). Free memory was 54.3MB in the beginning and 242.3MB in the end (delta: -188.0MB). Peak memory consumption was 364.4MB. Max. memory is 16.1GB. [2024-11-11 16:49:08,992 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 127.9MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:49:08,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 733.68ms. Allocated memory was 127.9MB in the beginning and 184.5MB in the end (delta: 56.6MB). Free memory was 54.3MB in the beginning and 116.5MB in the end (delta: -62.1MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2024-11-11 16:49:08,993 INFO L158 Benchmark]: Boogie Procedure Inliner took 150.02ms. Allocated memory is still 184.5MB. Free memory was 116.5MB in the beginning and 98.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 16:49:08,993 INFO L158 Benchmark]: Boogie Preprocessor took 182.12ms. Allocated memory is still 184.5MB. Free memory was 98.7MB in the beginning and 73.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 16:49:08,993 INFO L158 Benchmark]: RCFGBuilder took 1818.38ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 73.5MB in the beginning and 199.6MB in the end (delta: -126.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-11 16:49:08,994 INFO L158 Benchmark]: TraceAbstraction took 25194.57ms. Allocated memory was 253.8MB in the beginning and 677.4MB in the end (delta: 423.6MB). Free memory was 198.5MB in the beginning and 259.1MB in the end (delta: -60.6MB). Peak memory consumption was 418.1MB. Max. memory is 16.1GB. [2024-11-11 16:49:08,994 INFO L158 Benchmark]: Witness Printer took 200.20ms. Allocated memory is still 677.4MB. Free memory was 259.1MB in the beginning and 242.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 16:49:09,000 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 127.9MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 733.68ms. Allocated memory was 127.9MB in the beginning and 184.5MB in the end (delta: 56.6MB). Free memory was 54.3MB in the beginning and 116.5MB in the end (delta: -62.1MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 150.02ms. Allocated memory is still 184.5MB. Free memory was 116.5MB in the beginning and 98.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 182.12ms. Allocated memory is still 184.5MB. Free memory was 98.7MB in the beginning and 73.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1818.38ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 73.5MB in the beginning and 199.6MB in the end (delta: -126.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25194.57ms. Allocated memory was 253.8MB in the beginning and 677.4MB in the end (delta: 423.6MB). Free memory was 198.5MB in the beginning and 259.1MB in the end (delta: -60.6MB). Peak memory consumption was 418.1MB. Max. memory is 16.1GB. * Witness Printer took 200.20ms. Allocated memory is still 677.4MB. Free memory was 259.1MB in the beginning and 242.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 91]: 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 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.5s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3418 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3418 mSDsluCounter, 2780 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 397 mSDsCounter, 1861 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11447 IncrementalHoareTripleChecker+Invalid, 13308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1861 mSolverCounterUnsat, 2383 mSDtfsCounter, 11447 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10201occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 9481 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 3781 NumberOfCodeBlocks, 3781 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4064 ConstructedInterpolants, 0 QuantifiedInterpolants, 16020 SizeOfPredicates, 8 NumberOfNonLiveVariables, 409 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 3191/3320 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: 1044]: Loop Invariant Derived loop invariant: (((((((((((a25 == 13) && (a29 <= 599998)) && (a4 == 1)) || ((((((a25 == 13) && (a29 <= 599999)) && (a3 == 1)) && (((long long) a23 + 599772) <= 0)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 11) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((a25 == 11) && (((long long) a29 + 22) <= 0)) && (a4 == 1))) || ((a4 == 0) && (a29 <= 599998))) || (((((long long) a29 + 21) <= 0) && (a4 == 1)) && (a23 <= 312))) || ((((a25 == 11) && (a29 <= 599999)) && (a4 == 1)) && (a23 <= 312))) || ((((((a25 == 12) && (307 <= a23)) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:49:09,031 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