./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label04.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 dfc7a2daf16de8ab0ea0e11c62b30033c40981748d5071b1cd9dbc5bcc0c3347 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:37:59,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:37:59,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 09:37:59,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:37:59,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:37:59,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:37:59,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:37:59,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:37:59,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:37:59,893 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:37:59,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:37:59,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:37:59,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:37:59,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:37:59,895 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:37:59,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:37:59,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:37:59,896 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:37:59,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 09:37:59,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:37:59,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:37:59,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:37:59,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:37:59,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:37:59,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:37:59,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:37:59,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:37:59,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:37:59,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:37:59,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:37:59,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:37:59,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:37:59,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:37:59,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:37:59,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:37:59,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:37:59,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 09:37:59,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 09:37:59,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:37:59,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:37:59,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:37:59,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:37:59,907 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 -> dfc7a2daf16de8ab0ea0e11c62b30033c40981748d5071b1cd9dbc5bcc0c3347 [2024-11-18 09:38:00,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:38:00,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:38:00,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:38:00,118 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:38:00,118 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:38:00,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label04.c [2024-11-18 09:38:01,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:38:01,971 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:38:01,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label04.c [2024-11-18 09:38:01,994 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3430a92fa/4954de437ea445bd972fba92184422fa/FLAGd0ea0fab5 [2024-11-18 09:38:02,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3430a92fa/4954de437ea445bd972fba92184422fa [2024-11-18 09:38:02,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:38:02,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:38:02,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:38:02,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:38:02,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:38:02,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:38:02" (1/1) ... [2024-11-18 09:38:02,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e42f892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02, skipping insertion in model container [2024-11-18 09:38:02,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:38:02" (1/1) ... [2024-11-18 09:38:02,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:38:02,291 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/Problem02_label04.c[17470,17483] [2024-11-18 09:38:02,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:38:02,340 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:38:02,417 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/Problem02_label04.c[17470,17483] [2024-11-18 09:38:02,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:38:02,444 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:38:02,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02 WrapperNode [2024-11-18 09:38:02,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:38:02,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:38:02,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:38:02,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:38:02,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02" (1/1) ... [2024-11-18 09:38:02,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02" (1/1) ... [2024-11-18 09:38:02,507 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-18 09:38:02,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:38:02,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:38:02,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:38:02,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:38:02,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02" (1/1) ... [2024-11-18 09:38:02,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02" (1/1) ... [2024-11-18 09:38:02,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02" (1/1) ... [2024-11-18 09:38:02,567 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-18 09:38:02,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02" (1/1) ... [2024-11-18 09:38:02,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02" (1/1) ... [2024-11-18 09:38:02,621 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02" (1/1) ... [2024-11-18 09:38:02,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02" (1/1) ... [2024-11-18 09:38:02,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02" (1/1) ... [2024-11-18 09:38:02,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02" (1/1) ... [2024-11-18 09:38:02,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:38:02,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:38:02,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:38:02,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:38:02,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02" (1/1) ... [2024-11-18 09:38:02,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:38:02,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:38:02,701 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-18 09:38:02,706 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-18 09:38:02,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:38:02,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 09:38:02,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:38:02,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:38:02,841 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:38:02,843 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:38:03,535 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-18 09:38:03,535 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:38:03,561 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:38:03,561 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 09:38:03,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:38:03 BoogieIcfgContainer [2024-11-18 09:38:03,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:38:03,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:38:03,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:38:03,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:38:03,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:38:02" (1/3) ... [2024-11-18 09:38:03,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642b8fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:38:03, skipping insertion in model container [2024-11-18 09:38:03,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:02" (2/3) ... [2024-11-18 09:38:03,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642b8fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:38:03, skipping insertion in model container [2024-11-18 09:38:03,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:38:03" (3/3) ... [2024-11-18 09:38:03,570 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label04.c [2024-11-18 09:38:03,586 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:38:03,586 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:38:03,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:38:03,664 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;@12ec667b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:38:03,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:38:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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-18 09:38:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-18 09:38:03,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:03,686 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:38:03,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:03,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:03,693 INFO L85 PathProgramCache]: Analyzing trace with hash 585738029, now seen corresponding path program 1 times [2024-11-18 09:38:03,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:03,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720087996] [2024-11-18 09:38:03,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:03,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:04,242 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-18 09:38:04,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:04,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720087996] [2024-11-18 09:38:04,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720087996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:04,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:04,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:38:04,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558689734] [2024-11-18 09:38:04,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:04,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:04,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:04,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:04,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:04,275 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-18 09:38:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:05,385 INFO L93 Difference]: Finished difference Result 600 states and 1037 transitions. [2024-11-18 09:38:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:05,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 106 [2024-11-18 09:38:05,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:05,397 INFO L225 Difference]: With dead ends: 600 [2024-11-18 09:38:05,397 INFO L226 Difference]: Without dead ends: 309 [2024-11-18 09:38:05,400 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-18 09:38:05,402 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 60 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:05,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 09:38:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-18 09:38:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-11-18 09:38:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 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-18 09:38:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2024-11-18 09:38:05,441 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 106 [2024-11-18 09:38:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:05,441 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2024-11-18 09:38:05,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-18 09:38:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2024-11-18 09:38:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-18 09:38:05,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:05,445 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:05,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 09:38:05,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:05,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:05,446 INFO L85 PathProgramCache]: Analyzing trace with hash 318496888, now seen corresponding path program 1 times [2024-11-18 09:38:05,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:05,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873278478] [2024-11-18 09:38:05,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:05,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:38:05,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:05,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873278478] [2024-11-18 09:38:05,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873278478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:05,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:05,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:05,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407718387] [2024-11-18 09:38:05,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:05,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:05,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:05,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:05,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:05,614 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-18 09:38:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:05,998 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2024-11-18 09:38:05,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:05,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 111 [2024-11-18 09:38:05,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:06,001 INFO L225 Difference]: With dead ends: 758 [2024-11-18 09:38:06,002 INFO L226 Difference]: Without dead ends: 453 [2024-11-18 09:38:06,003 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-18 09:38:06,004 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 58 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:06,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 248 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:38:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-18 09:38:06,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2024-11-18 09:38:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.2787610619469028) internal successors, (578), 452 states have internal predecessors, (578), 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-18 09:38:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 578 transitions. [2024-11-18 09:38:06,026 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 578 transitions. Word has length 111 [2024-11-18 09:38:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:06,026 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 578 transitions. [2024-11-18 09:38:06,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-18 09:38:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2024-11-18 09:38:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-18 09:38:06,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:06,031 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:06,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 09:38:06,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:06,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:06,033 INFO L85 PathProgramCache]: Analyzing trace with hash 924088573, now seen corresponding path program 1 times [2024-11-18 09:38:06,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:06,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264671209] [2024-11-18 09:38:06,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:06,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:38:06,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:06,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264671209] [2024-11-18 09:38:06,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264671209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:06,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:06,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:38:06,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120317984] [2024-11-18 09:38:06,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:06,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:06,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:06,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:06,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:06,178 INFO L87 Difference]: Start difference. First operand 453 states and 578 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-18 09:38:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:06,592 INFO L93 Difference]: Finished difference Result 1325 states and 1691 transitions. [2024-11-18 09:38:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:06,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 123 [2024-11-18 09:38:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:06,597 INFO L225 Difference]: With dead ends: 1325 [2024-11-18 09:38:06,597 INFO L226 Difference]: Without dead ends: 874 [2024-11-18 09:38:06,598 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-18 09:38:06,599 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 185 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:06,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 79 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:38:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-18 09:38:06,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-18 09:38:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.2302405498281788) internal successors, (1074), 873 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-18 09:38:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1074 transitions. [2024-11-18 09:38:06,620 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1074 transitions. Word has length 123 [2024-11-18 09:38:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:06,620 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1074 transitions. [2024-11-18 09:38:06,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-18 09:38:06,620 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1074 transitions. [2024-11-18 09:38:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-18 09:38:06,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:06,624 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:06,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 09:38:06,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:06,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:06,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1386859920, now seen corresponding path program 1 times [2024-11-18 09:38:06,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:06,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290374206] [2024-11-18 09:38:06,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:06,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:38:06,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:06,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290374206] [2024-11-18 09:38:06,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290374206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:06,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:06,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:06,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982047491] [2024-11-18 09:38:06,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:06,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:06,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:06,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:06,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:06,739 INFO L87 Difference]: Start difference. First operand 874 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-18 09:38:07,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:07,270 INFO L93 Difference]: Finished difference Result 2594 states and 3192 transitions. [2024-11-18 09:38:07,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:07,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 136 [2024-11-18 09:38:07,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:07,276 INFO L225 Difference]: With dead ends: 2594 [2024-11-18 09:38:07,276 INFO L226 Difference]: Without dead ends: 1722 [2024-11-18 09:38:07,277 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-18 09:38:07,278 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 57 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:07,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 290 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 09:38:07,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2024-11-18 09:38:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1716. [2024-11-18 09:38:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1715 states have (on average 1.1900874635568512) internal successors, (2041), 1715 states have internal predecessors, (2041), 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-18 09:38:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2041 transitions. [2024-11-18 09:38:07,342 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2041 transitions. Word has length 136 [2024-11-18 09:38:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:07,342 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2041 transitions. [2024-11-18 09:38:07,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-18 09:38:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2041 transitions. [2024-11-18 09:38:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-18 09:38:07,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:07,347 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:07,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 09:38:07,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:07,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:07,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1212192576, now seen corresponding path program 1 times [2024-11-18 09:38:07,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:07,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606325134] [2024-11-18 09:38:07,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:38:07,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:07,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606325134] [2024-11-18 09:38:07,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606325134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:07,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:07,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:07,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846264071] [2024-11-18 09:38:07,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:07,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:07,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:07,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:07,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:07,467 INFO L87 Difference]: Start difference. First operand 1716 states and 2041 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-18 09:38:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:07,892 INFO L93 Difference]: Finished difference Result 3852 states and 4554 transitions. [2024-11-18 09:38:07,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:07,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-11-18 09:38:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:07,898 INFO L225 Difference]: With dead ends: 3852 [2024-11-18 09:38:07,899 INFO L226 Difference]: Without dead ends: 1856 [2024-11-18 09:38:07,901 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-18 09:38:07,902 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 158 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:07,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 66 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:38:07,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2024-11-18 09:38:07,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1854. [2024-11-18 09:38:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.119805720453319) internal successors, (2075), 1853 states have internal predecessors, (2075), 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-18 09:38:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2075 transitions. [2024-11-18 09:38:07,932 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2075 transitions. Word has length 152 [2024-11-18 09:38:07,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:07,932 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2075 transitions. [2024-11-18 09:38:07,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-18 09:38:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2075 transitions. [2024-11-18 09:38:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-18 09:38:07,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:07,936 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, 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] [2024-11-18 09:38:07,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 09:38:07,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:07,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:07,937 INFO L85 PathProgramCache]: Analyzing trace with hash -145608568, now seen corresponding path program 1 times [2024-11-18 09:38:07,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:07,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244147308] [2024-11-18 09:38:07,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:07,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:38:08,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:08,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244147308] [2024-11-18 09:38:08,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244147308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:08,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:08,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:08,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222798122] [2024-11-18 09:38:08,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:08,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:08,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:08,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:08,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:08,092 INFO L87 Difference]: Start difference. First operand 1854 states and 2075 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-18 09:38:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:08,512 INFO L93 Difference]: Finished difference Result 4404 states and 4920 transitions. [2024-11-18 09:38:08,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:08,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 153 [2024-11-18 09:38:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:08,521 INFO L225 Difference]: With dead ends: 4404 [2024-11-18 09:38:08,521 INFO L226 Difference]: Without dead ends: 2412 [2024-11-18 09:38:08,524 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-18 09:38:08,525 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:08,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 70 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:38:08,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2024-11-18 09:38:08,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2272. [2024-11-18 09:38:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.095112285336856) internal successors, (2487), 2271 states have internal predecessors, (2487), 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-18 09:38:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2487 transitions. [2024-11-18 09:38:08,573 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2487 transitions. Word has length 153 [2024-11-18 09:38:08,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:08,574 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 2487 transitions. [2024-11-18 09:38:08,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-18 09:38:08,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2487 transitions. [2024-11-18 09:38:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-18 09:38:08,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:08,579 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:38:08,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 09:38:08,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:08,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:08,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1045227919, now seen corresponding path program 1 times [2024-11-18 09:38:08,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:08,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328237376] [2024-11-18 09:38:08,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:08,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-18 09:38:08,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:08,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328237376] [2024-11-18 09:38:08,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328237376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:08,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:08,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:38:08,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013017666] [2024-11-18 09:38:08,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:08,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:08,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:08,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:08,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:08,796 INFO L87 Difference]: Start difference. First operand 2272 states and 2487 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:38:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:09,006 INFO L93 Difference]: Finished difference Result 4248 states and 4654 transitions. [2024-11-18 09:38:09,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:09,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2024-11-18 09:38:09,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:09,011 INFO L225 Difference]: With dead ends: 4248 [2024-11-18 09:38:09,012 INFO L226 Difference]: Without dead ends: 1836 [2024-11-18 09:38:09,014 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-18 09:38:09,015 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 154 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:09,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 18 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:38:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-11-18 09:38:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1556. [2024-11-18 09:38:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1555 states have (on average 1.0771704180064308) internal successors, (1675), 1555 states have internal predecessors, (1675), 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-18 09:38:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1675 transitions. [2024-11-18 09:38:09,039 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1675 transitions. Word has length 165 [2024-11-18 09:38:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:09,039 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 1675 transitions. [2024-11-18 09:38:09,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:38:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1675 transitions. [2024-11-18 09:38:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-18 09:38:09,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:09,042 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 09:38:09,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 09:38:09,043 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:09,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:09,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1306375099, now seen corresponding path program 1 times [2024-11-18 09:38:09,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:09,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772424164] [2024-11-18 09:38:09,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:09,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 09:38:09,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:09,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772424164] [2024-11-18 09:38:09,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772424164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:09,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:09,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:38:09,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799985351] [2024-11-18 09:38:09,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:09,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:38:09,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:09,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:38:09,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:38:09,392 INFO L87 Difference]: Start difference. First operand 1556 states and 1675 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 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-18 09:38:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:09,986 INFO L93 Difference]: Finished difference Result 3140 states and 3388 transitions. [2024-11-18 09:38:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:38:09,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 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 180 [2024-11-18 09:38:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:09,987 INFO L225 Difference]: With dead ends: 3140 [2024-11-18 09:38:09,988 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 09:38:09,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:38:09,991 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 172 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:09,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 62 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 09:38:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 09:38:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 09:38:09,992 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-18 09:38:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 09:38:09,992 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 180 [2024-11-18 09:38:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:09,992 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 09:38:09,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 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-18 09:38:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 09:38:09,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 09:38:09,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 09:38:10,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 09:38:10,006 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:10,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 09:38:10,238 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 09:38:10,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:38:10 BoogieIcfgContainer [2024-11-18 09:38:10,264 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 09:38:10,264 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 09:38:10,264 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 09:38:10,265 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 09:38:10,265 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:38:03" (3/4) ... [2024-11-18 09:38:10,267 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 09:38:10,295 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-18 09:38:10,296 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 09:38:10,300 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 09:38:10,300 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 09:38:10,488 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 09:38:10,489 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 09:38:10,489 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 09:38:10,490 INFO L158 Benchmark]: Toolchain (without parser) took 8477.81ms. Allocated memory was 159.4MB in the beginning and 354.4MB in the end (delta: 195.0MB). Free memory was 101.8MB in the beginning and 140.3MB in the end (delta: -38.5MB). Peak memory consumption was 157.4MB. Max. memory is 16.1GB. [2024-11-18 09:38:10,490 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:38:10,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.50ms. Allocated memory is still 159.4MB. Free memory was 101.8MB in the beginning and 73.3MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-18 09:38:10,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.15ms. Allocated memory is still 159.4MB. Free memory was 73.3MB in the beginning and 67.5MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 09:38:10,491 INFO L158 Benchmark]: Boogie Preprocessor took 149.96ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 67.5MB in the beginning and 221.3MB in the end (delta: -153.8MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-11-18 09:38:10,491 INFO L158 Benchmark]: RCFGBuilder took 902.52ms. Allocated memory is still 255.9MB. Free memory was 221.3MB in the beginning and 139.8MB in the end (delta: 81.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-11-18 09:38:10,492 INFO L158 Benchmark]: TraceAbstraction took 6700.93ms. Allocated memory was 255.9MB in the beginning and 354.4MB in the end (delta: 98.6MB). Free memory was 138.8MB in the beginning and 152.9MB in the end (delta: -14.1MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2024-11-18 09:38:10,492 INFO L158 Benchmark]: Witness Printer took 224.83ms. Allocated memory is still 354.4MB. Free memory was 152.9MB in the beginning and 140.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 09:38:10,493 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.14ms. Allocated memory is still 159.4MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.50ms. Allocated memory is still 159.4MB. Free memory was 101.8MB in the beginning and 73.3MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.15ms. Allocated memory is still 159.4MB. Free memory was 73.3MB in the beginning and 67.5MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 149.96ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 67.5MB in the beginning and 221.3MB in the end (delta: -153.8MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * RCFGBuilder took 902.52ms. Allocated memory is still 255.9MB. Free memory was 221.3MB in the beginning and 139.8MB in the end (delta: 81.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6700.93ms. Allocated memory was 255.9MB in the beginning and 354.4MB in the end (delta: 98.6MB). Free memory was 138.8MB in the beginning and 152.9MB in the end (delta: -14.1MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. * Witness Printer took 224.83ms. Allocated memory is still 354.4MB. Free memory was 152.9MB in the beginning and 140.3MB in the end (delta: 12.6MB). 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: 500]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 918 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 918 mSDsluCounter, 1004 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 576 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3079 IncrementalHoareTripleChecker+Invalid, 3655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 576 mSolverCounterUnsat, 883 mSDtfsCounter, 3079 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2272occurred in iteration=6, InterpolantAutomatonStates: 26, 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, 8 MinimizatonAttempts, 430 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1126 NumberOfCodeBlocks, 1126 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1118 ConstructedInterpolants, 0 QuantifiedInterpolants, 4218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 329/329 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: 616]: Loop Invariant Derived loop invariant: (((((((((a28 == 10) && (a17 <= 8)) || (((a17 <= 8) && (a28 <= 10)) && (a11 != 1))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || ((a28 == 10) && (a19 == 1))) || ((a17 <= 8) && (a28 <= 7))) || (((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || (((a25 == 1) && (a17 <= 8)) && (a28 <= 10))) || ((((a25 == 1) && (a19 == 1)) && (a11 != 1)) && (a28 <= 7))) RESULT: Ultimate proved your program to be correct! [2024-11-18 09:38:10,527 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