./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label21.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 d5ae1d248ac328ae194d38c847eaaf19b85e7124a7cd6c7e1aa145a759bc08e1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 22:01:41,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 22:01:41,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 22:01:41,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 22:01:41,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 22:01:42,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 22:01:42,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 22:01:42,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 22:01:42,011 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 22:01:42,011 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 22:01:42,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 22:01:42,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 22:01:42,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 22:01:42,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 22:01:42,013 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 22:01:42,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 22:01:42,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 22:01:42,013 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 22:01:42,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 22:01:42,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 22:01:42,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 22:01:42,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 22:01:42,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 22:01:42,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 22:01:42,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 22:01:42,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 22:01:42,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 22:01:42,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 22:01:42,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 22:01:42,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 22:01:42,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 22:01:42,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 22:01:42,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:01:42,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 22:01:42,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 22:01:42,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 22:01:42,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 22:01:42,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 22:01:42,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 22:01:42,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 22:01:42,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 22:01:42,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 22:01:42,021 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 -> d5ae1d248ac328ae194d38c847eaaf19b85e7124a7cd6c7e1aa145a759bc08e1 [2024-11-21 22:01:42,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 22:01:42,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 22:01:42,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 22:01:42,260 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 22:01:42,260 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 22:01:42,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label21.c [2024-11-21 22:01:43,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 22:01:43,851 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 22:01:43,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label21.c [2024-11-21 22:01:43,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5b5cdd4/a23ace1e50fa4730a602559a0c8726b7/FLAGaa2ca9296 [2024-11-21 22:01:43,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5b5cdd4/a23ace1e50fa4730a602559a0c8726b7 [2024-11-21 22:01:43,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 22:01:43,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 22:01:43,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 22:01:43,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 22:01:43,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 22:01:43,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:01:43" (1/1) ... [2024-11-21 22:01:43,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c73667b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:43, skipping insertion in model container [2024-11-21 22:01:43,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:01:43" (1/1) ... [2024-11-21 22:01:43,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 22:01:44,130 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/Problem10_label21.c[3267,3280] [2024-11-21 22:01:44,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:01:44,278 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 22:01:44,300 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/Problem10_label21.c[3267,3280] [2024-11-21 22:01:44,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:01:44,353 INFO L204 MainTranslator]: Completed translation [2024-11-21 22:01:44,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:44 WrapperNode [2024-11-21 22:01:44,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 22:01:44,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 22:01:44,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 22:01:44,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 22:01:44,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:44" (1/1) ... [2024-11-21 22:01:44,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:44" (1/1) ... [2024-11-21 22:01:44,421 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-21 22:01:44,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 22:01:44,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 22:01:44,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 22:01:44,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 22:01:44,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:44" (1/1) ... [2024-11-21 22:01:44,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:44" (1/1) ... [2024-11-21 22:01:44,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:44" (1/1) ... [2024-11-21 22:01:44,457 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-21 22:01:44,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:44" (1/1) ... [2024-11-21 22:01:44,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:44" (1/1) ... [2024-11-21 22:01:44,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:44" (1/1) ... [2024-11-21 22:01:44,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:44" (1/1) ... [2024-11-21 22:01:44,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:44" (1/1) ... [2024-11-21 22:01:44,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:44" (1/1) ... [2024-11-21 22:01:44,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 22:01:44,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 22:01:44,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 22:01:44,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 22:01:44,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:44" (1/1) ... [2024-11-21 22:01:44,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:01:44,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:01:44,541 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-21 22:01:44,545 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-21 22:01:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 22:01:44,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 22:01:44,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 22:01:44,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 22:01:44,638 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 22:01:44,640 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 22:01:45,653 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-21 22:01:45,653 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 22:01:45,670 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 22:01:45,671 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 22:01:45,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:45 BoogieIcfgContainer [2024-11-21 22:01:45,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 22:01:45,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 22:01:45,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 22:01:45,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 22:01:45,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:01:43" (1/3) ... [2024-11-21 22:01:45,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d71592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:01:45, skipping insertion in model container [2024-11-21 22:01:45,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:44" (2/3) ... [2024-11-21 22:01:45,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d71592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:01:45, skipping insertion in model container [2024-11-21 22:01:45,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:45" (3/3) ... [2024-11-21 22:01:45,678 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label21.c [2024-11-21 22:01:45,690 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 22:01:45,691 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 22:01:45,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 22:01:45,743 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;@70060db0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 22:01:45,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 22:01:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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-21 22:01:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-21 22:01:45,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:45,752 INFO L215 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, 1, 1] [2024-11-21 22:01:45,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:45,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash -438767135, now seen corresponding path program 1 times [2024-11-21 22:01:45,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:45,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276155791] [2024-11-21 22:01:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:45,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:45,939 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-21 22:01:45,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:45,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276155791] [2024-11-21 22:01:45,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276155791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:45,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:45,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:01:45,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031054058] [2024-11-21 22:01:45,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:45,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:45,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:45,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:45,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:45,972 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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-21 22:01:46,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:46,715 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-21 22:01:46,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:46,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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 27 [2024-11-21 22:01:46,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:46,726 INFO L225 Difference]: With dead ends: 552 [2024-11-21 22:01:46,726 INFO L226 Difference]: Without dead ends: 282 [2024-11-21 22:01:46,729 INFO L431 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-21 22:01:46,731 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:46,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 76 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 22:01:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-21 22:01:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-21 22:01:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 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-21 22:01:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2024-11-21 22:01:46,770 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 27 [2024-11-21 22:01:46,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:46,771 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2024-11-21 22:01:46,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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-21 22:01:46,771 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2024-11-21 22:01:46,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-21 22:01:46,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:46,774 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-21 22:01:46,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 22:01:46,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:46,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1203353191, now seen corresponding path program 1 times [2024-11-21 22:01:46,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:46,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537251207] [2024-11-21 22:01:46,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:46,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:47,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:47,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537251207] [2024-11-21 22:01:47,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537251207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:47,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:47,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:01:47,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586168500] [2024-11-21 22:01:47,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:47,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:47,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:47,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:47,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:47,083 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-21 22:01:47,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:47,477 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2024-11-21 22:01:47,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:47,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 96 [2024-11-21 22:01:47,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:47,480 INFO L225 Difference]: With dead ends: 701 [2024-11-21 22:01:47,482 INFO L226 Difference]: Without dead ends: 421 [2024-11-21 22:01:47,483 INFO L431 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-21 22:01:47,483 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:47,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 52 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:47,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-21 22:01:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-21 22:01:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4428571428571428) internal successors, (606), 420 states have internal predecessors, (606), 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-21 22:01:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2024-11-21 22:01:47,510 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 96 [2024-11-21 22:01:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:47,510 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2024-11-21 22:01:47,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-21 22:01:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2024-11-21 22:01:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-21 22:01:47,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:47,513 INFO L215 NwaCegarLoop]: trace histogram [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-21 22:01:47,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 22:01:47,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:47,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:47,514 INFO L85 PathProgramCache]: Analyzing trace with hash 541830856, now seen corresponding path program 1 times [2024-11-21 22:01:47,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:47,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77296128] [2024-11-21 22:01:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:47,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:47,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:47,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77296128] [2024-11-21 22:01:47,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77296128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:47,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:47,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:47,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895093860] [2024-11-21 22:01:47,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:47,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:47,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:47,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:47,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:47,665 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-21 22:01:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:48,103 INFO L93 Difference]: Finished difference Result 1118 states and 1639 transitions. [2024-11-21 22:01:48,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:48,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 102 [2024-11-21 22:01:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:48,110 INFO L225 Difference]: With dead ends: 1118 [2024-11-21 22:01:48,110 INFO L226 Difference]: Without dead ends: 838 [2024-11-21 22:01:48,110 INFO L431 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-21 22:01:48,111 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 115 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:48,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 226 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-21 22:01:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2024-11-21 22:01:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.330945558739255) internal successors, (929), 698 states have internal predecessors, (929), 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-21 22:01:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 929 transitions. [2024-11-21 22:01:48,135 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 929 transitions. Word has length 102 [2024-11-21 22:01:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:48,135 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 929 transitions. [2024-11-21 22:01:48,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-21 22:01:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 929 transitions. [2024-11-21 22:01:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-21 22:01:48,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:48,137 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:48,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 22:01:48,137 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:48,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:48,138 INFO L85 PathProgramCache]: Analyzing trace with hash 557225786, now seen corresponding path program 1 times [2024-11-21 22:01:48,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:48,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345321303] [2024-11-21 22:01:48,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:48,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:48,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:48,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345321303] [2024-11-21 22:01:48,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345321303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:48,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:48,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:01:48,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424113145] [2024-11-21 22:01:48,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:48,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:48,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:48,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:48,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:48,248 INFO L87 Difference]: Start difference. First operand 699 states and 929 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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-21 22:01:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:48,627 INFO L93 Difference]: Finished difference Result 1396 states and 1962 transitions. [2024-11-21 22:01:48,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:48,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2024-11-21 22:01:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:48,630 INFO L225 Difference]: With dead ends: 1396 [2024-11-21 22:01:48,630 INFO L226 Difference]: Without dead ends: 838 [2024-11-21 22:01:48,631 INFO L431 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-21 22:01:48,632 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 52 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:48,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 76 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:48,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-21 22:01:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-21 22:01:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2831541218637992) internal successors, (1074), 837 states have internal predecessors, (1074), 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-21 22:01:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1074 transitions. [2024-11-21 22:01:48,644 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1074 transitions. Word has length 121 [2024-11-21 22:01:48,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:48,644 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1074 transitions. [2024-11-21 22:01:48,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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-21 22:01:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1074 transitions. [2024-11-21 22:01:48,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-21 22:01:48,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:48,647 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-21 22:01:48,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 22:01:48,647 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:48,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash 507322598, now seen corresponding path program 1 times [2024-11-21 22:01:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:48,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362623339] [2024-11-21 22:01:48,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:48,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-21 22:01:48,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:48,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362623339] [2024-11-21 22:01:48,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362623339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:48,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:48,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:01:48,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805239562] [2024-11-21 22:01:48,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:48,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:48,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:48,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:48,789 INFO L87 Difference]: Start difference. First operand 838 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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-21 22:01:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:49,139 INFO L93 Difference]: Finished difference Result 1813 states and 2330 transitions. [2024-11-21 22:01:49,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:49,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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 162 [2024-11-21 22:01:49,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:49,143 INFO L225 Difference]: With dead ends: 1813 [2024-11-21 22:01:49,143 INFO L226 Difference]: Without dead ends: 1116 [2024-11-21 22:01:49,147 INFO L431 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-21 22:01:49,149 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:49,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 34 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 22:01:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-21 22:01:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2024-11-21 22:01:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1766816143497758) internal successors, (1312), 1115 states have internal predecessors, (1312), 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-21 22:01:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1312 transitions. [2024-11-21 22:01:49,174 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1312 transitions. Word has length 162 [2024-11-21 22:01:49,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:49,175 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1312 transitions. [2024-11-21 22:01:49,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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-21 22:01:49,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1312 transitions. [2024-11-21 22:01:49,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-21 22:01:49,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:49,179 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-21 22:01:49,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 22:01:49,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:49,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash 173497465, now seen corresponding path program 1 times [2024-11-21 22:01:49,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:49,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585228952] [2024-11-21 22:01:49,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:49,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:49,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:49,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585228952] [2024-11-21 22:01:49,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585228952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:49,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:49,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:49,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431186627] [2024-11-21 22:01:49,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:49,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:49,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:49,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:49,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:49,306 INFO L87 Difference]: Start difference. First operand 1116 states and 1312 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-21 22:01:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:49,875 INFO L93 Difference]: Finished difference Result 2369 states and 2857 transitions. [2024-11-21 22:01:49,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:49,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 179 [2024-11-21 22:01:49,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:49,881 INFO L225 Difference]: With dead ends: 2369 [2024-11-21 22:01:49,881 INFO L226 Difference]: Without dead ends: 1394 [2024-11-21 22:01:49,882 INFO L431 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-21 22:01:49,885 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 58 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:49,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 215 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:01:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-21 22:01:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1255. [2024-11-21 22:01:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1650717703349283) internal successors, (1461), 1254 states have internal predecessors, (1461), 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-21 22:01:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1461 transitions. [2024-11-21 22:01:49,907 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1461 transitions. Word has length 179 [2024-11-21 22:01:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:49,907 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1461 transitions. [2024-11-21 22:01:49,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-21 22:01:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1461 transitions. [2024-11-21 22:01:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-21 22:01:49,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:49,911 INFO L215 NwaCegarLoop]: trace histogram [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, 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-21 22:01:49,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 22:01:49,911 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:49,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash 205771184, now seen corresponding path program 1 times [2024-11-21 22:01:49,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:49,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786738217] [2024-11-21 22:01:49,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:49,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-21 22:01:50,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:50,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786738217] [2024-11-21 22:01:50,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786738217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:50,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:50,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:50,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091466246] [2024-11-21 22:01:50,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:50,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:50,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:50,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:50,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:50,052 INFO L87 Difference]: Start difference. First operand 1255 states and 1461 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-21 22:01:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:50,468 INFO L93 Difference]: Finished difference Result 1813 states and 2105 transitions. [2024-11-21 22:01:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:50,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 201 [2024-11-21 22:01:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:50,472 INFO L225 Difference]: With dead ends: 1813 [2024-11-21 22:01:50,472 INFO L226 Difference]: Without dead ends: 1811 [2024-11-21 22:01:50,473 INFO L431 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-21 22:01:50,473 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 157 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:50,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 11 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-21 22:01:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1255. [2024-11-21 22:01:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1650717703349283) internal successors, (1461), 1254 states have internal predecessors, (1461), 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-21 22:01:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1461 transitions. [2024-11-21 22:01:50,487 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1461 transitions. Word has length 201 [2024-11-21 22:01:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:50,487 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1461 transitions. [2024-11-21 22:01:50,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-21 22:01:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1461 transitions. [2024-11-21 22:01:50,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-21 22:01:50,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:50,490 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:01:50,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 22:01:50,490 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:50,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:50,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1148960943, now seen corresponding path program 1 times [2024-11-21 22:01:50,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:50,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130528833] [2024-11-21 22:01:50,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:50,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-21 22:01:50,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:50,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130528833] [2024-11-21 22:01:50,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130528833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:50,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:50,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 22:01:50,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743754048] [2024-11-21 22:01:50,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:50,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-21 22:01:50,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:50,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-21 22:01:50,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-21 22:01:50,908 INFO L87 Difference]: Start difference. First operand 1255 states and 1461 transitions. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 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-21 22:01:51,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:51,322 INFO L93 Difference]: Finished difference Result 2424 states and 2831 transitions. [2024-11-21 22:01:51,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 22:01:51,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 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-21 22:01:51,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:51,325 INFO L225 Difference]: With dead ends: 2424 [2024-11-21 22:01:51,325 INFO L226 Difference]: Without dead ends: 1255 [2024-11-21 22:01:51,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-21 22:01:51,327 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:51,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 20 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-21 22:01:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-21 22:01:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1602870813397128) internal successors, (1455), 1254 states have internal predecessors, (1455), 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-21 22:01:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1455 transitions. [2024-11-21 22:01:51,340 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1455 transitions. Word has length 290 [2024-11-21 22:01:51,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:51,341 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1455 transitions. [2024-11-21 22:01:51,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 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-21 22:01:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1455 transitions. [2024-11-21 22:01:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-21 22:01:51,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:51,344 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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] [2024-11-21 22:01:51,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 22:01:51,344 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:51,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash 96831339, now seen corresponding path program 1 times [2024-11-21 22:01:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:51,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029693246] [2024-11-21 22:01:51,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:51,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-21 22:01:51,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:51,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029693246] [2024-11-21 22:01:51,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029693246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:51,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:51,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:51,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586182906] [2024-11-21 22:01:51,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:51,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:51,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:51,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:51,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:51,768 INFO L87 Difference]: Start difference. First operand 1255 states and 1455 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-21 22:01:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:52,152 INFO L93 Difference]: Finished difference Result 2369 states and 2765 transitions. [2024-11-21 22:01:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:52,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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 326 [2024-11-21 22:01:52,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:52,158 INFO L225 Difference]: With dead ends: 2369 [2024-11-21 22:01:52,158 INFO L226 Difference]: Without dead ends: 1255 [2024-11-21 22:01:52,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-21 22:01:52,159 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 137 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:52,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 159 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:52,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-21 22:01:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1116. [2024-11-21 22:01:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1318385650224214) internal successors, (1262), 1115 states have internal predecessors, (1262), 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-21 22:01:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1262 transitions. [2024-11-21 22:01:52,192 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1262 transitions. Word has length 326 [2024-11-21 22:01:52,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:52,193 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1262 transitions. [2024-11-21 22:01:52,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-21 22:01:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1262 transitions. [2024-11-21 22:01:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-21 22:01:52,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:52,197 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:52,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 22:01:52,197 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:52,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash 449619609, now seen corresponding path program 1 times [2024-11-21 22:01:52,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:52,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466790737] [2024-11-21 22:01:52,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:52,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-21 22:01:52,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:52,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466790737] [2024-11-21 22:01:52,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466790737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:52,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:52,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:52,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791673537] [2024-11-21 22:01:52,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:52,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:52,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:52,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:52,397 INFO L87 Difference]: Start difference. First operand 1116 states and 1262 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-21 22:01:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:52,849 INFO L93 Difference]: Finished difference Result 2786 states and 3188 transitions. [2024-11-21 22:01:52,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:52,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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 328 [2024-11-21 22:01:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:52,853 INFO L225 Difference]: With dead ends: 2786 [2024-11-21 22:01:52,854 INFO L226 Difference]: Without dead ends: 1811 [2024-11-21 22:01:52,855 INFO L431 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-21 22:01:52,855 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 21 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:52,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 205 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:01:52,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-21 22:01:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1811. [2024-11-21 22:01:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.1171270718232045) internal successors, (2022), 1810 states have internal predecessors, (2022), 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-21 22:01:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2022 transitions. [2024-11-21 22:01:52,876 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2022 transitions. Word has length 328 [2024-11-21 22:01:52,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:52,877 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2022 transitions. [2024-11-21 22:01:52,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-21 22:01:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2022 transitions. [2024-11-21 22:01:52,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-21 22:01:52,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:52,881 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:52,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 22:01:52,882 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:52,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:52,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2003182581, now seen corresponding path program 1 times [2024-11-21 22:01:52,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:52,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635740130] [2024-11-21 22:01:52,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:52,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-21 22:01:53,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:53,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635740130] [2024-11-21 22:01:53,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635740130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:53,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:53,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:53,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464679301] [2024-11-21 22:01:53,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:53,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:53,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:53,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:53,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:53,081 INFO L87 Difference]: Start difference. First operand 1811 states and 2022 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-21 22:01:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:53,848 INFO L93 Difference]: Finished difference Result 3618 states and 4082 transitions. [2024-11-21 22:01:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:53,849 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 341 [2024-11-21 22:01:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:53,850 INFO L225 Difference]: With dead ends: 3618 [2024-11-21 22:01:53,850 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 22:01:53,852 INFO L431 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-21 22:01:53,853 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 115 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:53,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 222 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 22:01:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 22:01:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 22:01:53,854 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-21 22:01:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 22:01:53,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 341 [2024-11-21 22:01:53,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:53,854 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 22:01:53,854 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-21 22:01:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 22:01:53,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 22:01:53,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 22:01:53,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 22:01:53,859 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:53,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 22:01:54,074 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 22:01:54,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:01:54 BoogieIcfgContainer [2024-11-21 22:01:54,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 22:01:54,097 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 22:01:54,098 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 22:01:54,098 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 22:01:54,098 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:45" (3/4) ... [2024-11-21 22:01:54,100 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 22:01:54,112 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 22:01:54,116 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 22:01:54,117 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 22:01:54,117 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 22:01:54,229 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 22:01:54,229 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 22:01:54,229 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 22:01:54,230 INFO L158 Benchmark]: Toolchain (without parser) took 10344.79ms. Allocated memory was 165.7MB in the beginning and 356.5MB in the end (delta: 190.8MB). Free memory was 95.7MB in the beginning and 137.4MB in the end (delta: -41.7MB). Peak memory consumption was 151.7MB. Max. memory is 16.1GB. [2024-11-21 22:01:54,230 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 165.7MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 22:01:54,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.73ms. Allocated memory is still 165.7MB. Free memory was 95.5MB in the beginning and 119.5MB in the end (delta: -23.9MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-21 22:01:54,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.10ms. Allocated memory is still 165.7MB. Free memory was 119.5MB in the beginning and 111.7MB in the end (delta: 7.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-21 22:01:54,231 INFO L158 Benchmark]: Boogie Preprocessor took 90.10ms. Allocated memory is still 165.7MB. Free memory was 111.7MB in the beginning and 101.4MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-21 22:01:54,231 INFO L158 Benchmark]: RCFGBuilder took 1158.56ms. Allocated memory is still 165.7MB. Free memory was 101.4MB in the beginning and 90.3MB in the end (delta: 11.2MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. [2024-11-21 22:01:54,231 INFO L158 Benchmark]: TraceAbstraction took 8423.68ms. Allocated memory was 165.7MB in the beginning and 356.5MB in the end (delta: 190.8MB). Free memory was 89.5MB in the beginning and 148.9MB in the end (delta: -59.4MB). Peak memory consumption was 131.0MB. Max. memory is 16.1GB. [2024-11-21 22:01:54,231 INFO L158 Benchmark]: Witness Printer took 131.79ms. Allocated memory is still 356.5MB. Free memory was 148.9MB in the beginning and 137.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 22:01:54,232 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.12ms. Allocated memory is still 165.7MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.73ms. Allocated memory is still 165.7MB. Free memory was 95.5MB in the beginning and 119.5MB in the end (delta: -23.9MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.10ms. Allocated memory is still 165.7MB. Free memory was 119.5MB in the beginning and 111.7MB in the end (delta: 7.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.10ms. Allocated memory is still 165.7MB. Free memory was 111.7MB in the beginning and 101.4MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1158.56ms. Allocated memory is still 165.7MB. Free memory was 101.4MB in the beginning and 90.3MB in the end (delta: 11.2MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8423.68ms. Allocated memory was 165.7MB in the beginning and 356.5MB in the end (delta: 190.8MB). Free memory was 89.5MB in the beginning and 148.9MB in the end (delta: -59.4MB). Peak memory consumption was 131.0MB. Max. memory is 16.1GB. * Witness Printer took 131.79ms. Allocated memory is still 356.5MB. Free memory was 148.9MB in the beginning and 137.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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: 95]: 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1138 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1138 mSDsluCounter, 1296 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 669 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4178 IncrementalHoareTripleChecker+Invalid, 4847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 669 mSolverCounterUnsat, 1240 mSDtfsCounter, 4178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1811occurred in iteration=10, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 973 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2173 NumberOfCodeBlocks, 2173 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2162 ConstructedInterpolants, 0 QuantifiedInterpolants, 4777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1700/1700 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: 592]: Loop Invariant Derived loop invariant: (((((((a10 <= 0) && (8 <= a19)) && (14 == a4)) && (a12 == 0)) || ((((a19 <= 9) && (14 == a4)) && (a12 == 0)) && (a10 != 0))) || (((14 == a4) && (a12 == 0)) && (a19 == 6))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-21 22:01:54,251 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