./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label52.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/Problem11_label52.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 58258448060d1dd7e4bb5d8ae4d59fa53c9505b7e75cc42e4b9e13d20eabdbf0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 22:05:01,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 22:05:01,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 22:05:01,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 22:05:01,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 22:05:01,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 22:05:01,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 22:05:01,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 22:05:01,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 22:05:01,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 22:05:01,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 22:05:01,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 22:05:01,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 22:05:01,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 22:05:01,878 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 22:05:01,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 22:05:01,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 22:05:01,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 22:05:01,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 22:05:01,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 22:05:01,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 22:05:01,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 22:05:01,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 22:05:01,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 22:05:01,882 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 22:05:01,883 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 22:05:01,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 22:05:01,883 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 22:05:01,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 22:05:01,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 22:05:01,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 22:05:01,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 22:05:01,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:05:01,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 22:05:01,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 22:05:01,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 22:05:01,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 22:05:01,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 22:05:01,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 22:05:01,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 22:05:01,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 22:05:01,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 22:05:01,886 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 -> 58258448060d1dd7e4bb5d8ae4d59fa53c9505b7e75cc42e4b9e13d20eabdbf0 [2024-11-21 22:05:02,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 22:05:02,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 22:05:02,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 22:05:02,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 22:05:02,116 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 22:05:02,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label52.c [2024-11-21 22:05:03,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 22:05:03,534 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 22:05:03,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label52.c [2024-11-21 22:05:03,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5359fc0a2/27d1c9945eaa41c5b862c40e5d0608b3/FLAG067b37c8b [2024-11-21 22:05:03,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5359fc0a2/27d1c9945eaa41c5b862c40e5d0608b3 [2024-11-21 22:05:03,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 22:05:03,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 22:05:03,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 22:05:03,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 22:05:03,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 22:05:03,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:05:03" (1/1) ... [2024-11-21 22:05:03,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a186322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:03, skipping insertion in model container [2024-11-21 22:05:03,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:05:03" (1/1) ... [2024-11-21 22:05:03,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 22:05:04,102 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label52.c[7609,7622] [2024-11-21 22:05:04,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:05:04,249 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 22:05:04,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label52.c[7609,7622] [2024-11-21 22:05:04,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:05:04,362 INFO L204 MainTranslator]: Completed translation [2024-11-21 22:05:04,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:04 WrapperNode [2024-11-21 22:05:04,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 22:05:04,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 22:05:04,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 22:05:04,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 22:05:04,368 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:05:04" (1/1) ... [2024-11-21 22:05:04,388 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:05:04" (1/1) ... [2024-11-21 22:05:04,492 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-21 22:05:04,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 22:05:04,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 22:05:04,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 22:05:04,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 22:05:04,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:04" (1/1) ... [2024-11-21 22:05:04,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:04" (1/1) ... [2024-11-21 22:05:04,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:04" (1/1) ... [2024-11-21 22:05:04,592 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:05:04,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:04" (1/1) ... [2024-11-21 22:05:04,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:04" (1/1) ... [2024-11-21 22:05:04,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:04" (1/1) ... [2024-11-21 22:05:04,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:04" (1/1) ... [2024-11-21 22:05:04,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:04" (1/1) ... [2024-11-21 22:05:04,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:04" (1/1) ... [2024-11-21 22:05:04,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 22:05:04,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 22:05:04,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 22:05:04,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 22:05:04,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:04" (1/1) ... [2024-11-21 22:05:04,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:05:04,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:05:04,711 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:05:04,715 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:05:04,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 22:05:04,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 22:05:04,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 22:05:04,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 22:05:04,797 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 22:05:04,799 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 22:05:05,876 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-21 22:05:05,876 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 22:05:05,894 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 22:05:05,895 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 22:05:05,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:05:05 BoogieIcfgContainer [2024-11-21 22:05:05,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 22:05:05,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 22:05:05,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 22:05:05,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 22:05:05,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:05:03" (1/3) ... [2024-11-21 22:05:05,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c15a0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:05:05, skipping insertion in model container [2024-11-21 22:05:05,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:04" (2/3) ... [2024-11-21 22:05:05,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c15a0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:05:05, skipping insertion in model container [2024-11-21 22:05:05,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:05:05" (3/3) ... [2024-11-21 22:05:05,903 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label52.c [2024-11-21 22:05:05,916 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 22:05:05,916 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 22:05:05,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 22:05:05,983 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;@3ef447cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 22:05:05,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 22:05:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:05:05,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-21 22:05:05,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:05,997 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] [2024-11-21 22:05:05,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:06,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:06,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1382487458, now seen corresponding path program 1 times [2024-11-21 22:05:06,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:06,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487106765] [2024-11-21 22:05:06,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:06,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:06,334 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:05:06,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:06,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487106765] [2024-11-21 22:05:06,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487106765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:06,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:06,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:05:06,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660501924] [2024-11-21 22:05:06,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:06,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:06,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:06,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:06,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:06,361 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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:05:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:07,204 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2024-11-21 22:05:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:07,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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 52 [2024-11-21 22:05:07,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:07,219 INFO L225 Difference]: With dead ends: 761 [2024-11-21 22:05:07,220 INFO L226 Difference]: Without dead ends: 413 [2024-11-21 22:05:07,225 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:05:07,228 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 176 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:07,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 22:05:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-21 22:05:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-21 22:05:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 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:05:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2024-11-21 22:05:07,272 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 52 [2024-11-21 22:05:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:07,273 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2024-11-21 22:05:07,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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:05:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2024-11-21 22:05:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-21 22:05:07,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:07,275 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, 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] [2024-11-21 22:05:07,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 22:05:07,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:07,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:07,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1697477018, now seen corresponding path program 1 times [2024-11-21 22:05:07,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:07,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129199838] [2024-11-21 22:05:07,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:07,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:07,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:07,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129199838] [2024-11-21 22:05:07,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129199838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:07,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:07,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:05:07,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10930932] [2024-11-21 22:05:07,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:07,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:07,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:07,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:07,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:07,495 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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:05:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:08,124 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2024-11-21 22:05:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:08,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 120 [2024-11-21 22:05:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:08,128 INFO L225 Difference]: With dead ends: 1211 [2024-11-21 22:05:08,128 INFO L226 Difference]: Without dead ends: 800 [2024-11-21 22:05:08,129 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:05:08,130 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:08,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:05:08,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-21 22:05:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2024-11-21 22:05:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 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:05:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2024-11-21 22:05:08,152 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 120 [2024-11-21 22:05:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:08,153 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2024-11-21 22:05:08,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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:05:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2024-11-21 22:05:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-21 22:05:08,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:08,156 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, 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:05:08,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 22:05:08,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:08,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash 690386357, now seen corresponding path program 1 times [2024-11-21 22:05:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:08,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863398497] [2024-11-21 22:05:08,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:08,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:08,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:08,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863398497] [2024-11-21 22:05:08,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863398497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:08,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:08,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:05:08,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124970229] [2024-11-21 22:05:08,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:08,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:08,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:08,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:08,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:08,435 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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:05:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:08,990 INFO L93 Difference]: Finished difference Result 1945 states and 2612 transitions. [2024-11-21 22:05:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:08,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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 122 [2024-11-21 22:05:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:08,994 INFO L225 Difference]: With dead ends: 1945 [2024-11-21 22:05:08,994 INFO L226 Difference]: Without dead ends: 1158 [2024-11-21 22:05:08,995 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:05:08,996 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:08,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:05:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-21 22:05:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2024-11-21 22:05:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2707612456747406) internal successors, (1469), 1156 states have internal predecessors, (1469), 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:05:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1469 transitions. [2024-11-21 22:05:09,018 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1469 transitions. Word has length 122 [2024-11-21 22:05:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:09,019 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1469 transitions. [2024-11-21 22:05:09,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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:05:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1469 transitions. [2024-11-21 22:05:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-21 22:05:09,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:09,022 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, 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] [2024-11-21 22:05:09,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 22:05:09,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:09,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:09,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1804040649, now seen corresponding path program 1 times [2024-11-21 22:05:09,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:09,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906254209] [2024-11-21 22:05:09,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:09,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:09,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:09,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906254209] [2024-11-21 22:05:09,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906254209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:09,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:09,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:09,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133550121] [2024-11-21 22:05:09,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:09,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:09,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:09,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:09,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:09,218 INFO L87 Difference]: Start difference. First operand 1157 states and 1469 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:05:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:09,807 INFO L93 Difference]: Finished difference Result 2519 states and 3349 transitions. [2024-11-21 22:05:09,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:09,808 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:05:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:09,812 INFO L225 Difference]: With dead ends: 2519 [2024-11-21 22:05:09,812 INFO L226 Difference]: Without dead ends: 1548 [2024-11-21 22:05:09,813 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:05:09,814 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 183 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:09,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:05:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-11-21 22:05:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545. [2024-11-21 22:05:09,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.2933937823834196) internal successors, (1997), 1544 states have internal predecessors, (1997), 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:05:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1997 transitions. [2024-11-21 22:05:09,839 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1997 transitions. Word has length 179 [2024-11-21 22:05:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:09,840 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1997 transitions. [2024-11-21 22:05:09,840 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:05:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1997 transitions. [2024-11-21 22:05:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-21 22:05:09,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:09,844 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:09,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 22:05:09,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:09,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:09,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1655174799, now seen corresponding path program 1 times [2024-11-21 22:05:09,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:09,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417788920] [2024-11-21 22:05:09,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:09,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-21 22:05:10,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:10,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417788920] [2024-11-21 22:05:10,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417788920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:10,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:10,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:10,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011669455] [2024-11-21 22:05:10,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:10,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:10,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:10,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:10,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:10,082 INFO L87 Difference]: Start difference. First operand 1545 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:05:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:10,668 INFO L93 Difference]: Finished difference Result 3650 states and 4815 transitions. [2024-11-21 22:05:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:10,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 234 [2024-11-21 22:05:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:10,674 INFO L225 Difference]: With dead ends: 3650 [2024-11-21 22:05:10,674 INFO L226 Difference]: Without dead ends: 2291 [2024-11-21 22:05:10,676 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:05:10,677 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 145 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:10,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:05:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2024-11-21 22:05:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2098. [2024-11-21 22:05:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2097 states have (on average 1.2675250357653791) internal successors, (2658), 2097 states have internal predecessors, (2658), 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:05:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2658 transitions. [2024-11-21 22:05:10,701 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2658 transitions. Word has length 234 [2024-11-21 22:05:10,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:10,702 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 2658 transitions. [2024-11-21 22:05:10,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:05:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2658 transitions. [2024-11-21 22:05:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-21 22:05:10,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:10,704 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:10,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 22:05:10,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:10,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:10,705 INFO L85 PathProgramCache]: Analyzing trace with hash 203587778, now seen corresponding path program 1 times [2024-11-21 22:05:10,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:10,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564260919] [2024-11-21 22:05:10,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:10,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 95 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-21 22:05:11,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564260919] [2024-11-21 22:05:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564260919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:05:11,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500896136] [2024-11-21 22:05:11,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:11,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:05:11,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:05:11,222 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 22:05:11,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-21 22:05:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:11,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:05:11,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:05:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-21 22:05:11,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:05:11,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500896136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:11,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:05:11,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-21 22:05:11,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313044828] [2024-11-21 22:05:11,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:11,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:11,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:11,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:11,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-21 22:05:11,415 INFO L87 Difference]: Start difference. First operand 2098 states and 2658 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:05:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:12,014 INFO L93 Difference]: Finished difference Result 5851 states and 7488 transitions. [2024-11-21 22:05:12,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:12,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 240 [2024-11-21 22:05:12,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:12,024 INFO L225 Difference]: With dead ends: 5851 [2024-11-21 22:05:12,024 INFO L226 Difference]: Without dead ends: 3755 [2024-11-21 22:05:12,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-21 22:05:12,027 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 159 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:12,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 144 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:05:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2024-11-21 22:05:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 3755. [2024-11-21 22:05:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3754 states have (on average 1.245338305807139) internal successors, (4675), 3754 states have internal predecessors, (4675), 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:05:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 4675 transitions. [2024-11-21 22:05:12,070 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 4675 transitions. Word has length 240 [2024-11-21 22:05:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:12,070 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 4675 transitions. [2024-11-21 22:05:12,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:05:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 4675 transitions. [2024-11-21 22:05:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-21 22:05:12,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:12,075 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, 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, 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] [2024-11-21 22:05:12,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-21 22:05:12,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-21 22:05:12,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:12,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1866944109, now seen corresponding path program 1 times [2024-11-21 22:05:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518577547] [2024-11-21 22:05:12,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:12,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-21 22:05:12,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:12,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518577547] [2024-11-21 22:05:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518577547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:12,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:12,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:12,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966473340] [2024-11-21 22:05:12,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:12,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:12,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:12,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:12,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:12,498 INFO L87 Difference]: Start difference. First operand 3755 states and 4675 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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:05:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:13,119 INFO L93 Difference]: Finished difference Result 8622 states and 10849 transitions. [2024-11-21 22:05:13,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:13,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 271 [2024-11-21 22:05:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:13,131 INFO L225 Difference]: With dead ends: 8622 [2024-11-21 22:05:13,131 INFO L226 Difference]: Without dead ends: 4869 [2024-11-21 22:05:13,135 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:05:13,135 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 144 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:13,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 391 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:05:13,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2024-11-21 22:05:13,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4860. [2024-11-21 22:05:13,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4860 states, 4859 states have (on average 1.2251492076558963) internal successors, (5953), 4859 states have internal predecessors, (5953), 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:05:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 5953 transitions. [2024-11-21 22:05:13,189 INFO L78 Accepts]: Start accepts. Automaton has 4860 states and 5953 transitions. Word has length 271 [2024-11-21 22:05:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:13,190 INFO L471 AbstractCegarLoop]: Abstraction has 4860 states and 5953 transitions. [2024-11-21 22:05:13,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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:05:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 4860 states and 5953 transitions. [2024-11-21 22:05:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-11-21 22:05:13,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:13,196 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:13,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 22:05:13,196 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:13,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:13,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1398635958, now seen corresponding path program 1 times [2024-11-21 22:05:13,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:13,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232909596] [2024-11-21 22:05:13,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:13,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-21 22:05:13,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:13,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232909596] [2024-11-21 22:05:13,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232909596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:13,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:13,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:13,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614848340] [2024-11-21 22:05:13,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:13,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:13,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:13,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:13,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:13,367 INFO L87 Difference]: Start difference. First operand 4860 states and 5953 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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:05:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:13,912 INFO L93 Difference]: Finished difference Result 11005 states and 13678 transitions. [2024-11-21 22:05:13,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:13,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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 317 [2024-11-21 22:05:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:13,926 INFO L225 Difference]: With dead ends: 11005 [2024-11-21 22:05:13,927 INFO L226 Difference]: Without dead ends: 6147 [2024-11-21 22:05:13,931 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:05:13,932 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 172 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:13,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 151 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:05:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2024-11-21 22:05:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 4853. [2024-11-21 22:05:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 4852 states have (on average 1.224855729596043) internal successors, (5943), 4852 states have internal predecessors, (5943), 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:05:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 5943 transitions. [2024-11-21 22:05:13,990 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 5943 transitions. Word has length 317 [2024-11-21 22:05:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:13,990 INFO L471 AbstractCegarLoop]: Abstraction has 4853 states and 5943 transitions. [2024-11-21 22:05:13,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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:05:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 5943 transitions. [2024-11-21 22:05:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-21 22:05:13,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:13,997 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, 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, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 22:05:13,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 22:05:13,997 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:13,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:13,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2108175850, now seen corresponding path program 1 times [2024-11-21 22:05:13,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:13,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930916026] [2024-11-21 22:05:13,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:13,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 167 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:14,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:14,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930916026] [2024-11-21 22:05:14,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930916026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:05:14,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991476574] [2024-11-21 22:05:14,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:14,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:05:14,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:05:14,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 22:05:14,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-21 22:05:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:14,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-21 22:05:14,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:05:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 167 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:15,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 22:05:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 167 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:17,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991476574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 22:05:17,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 22:05:17,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-21 22:05:17,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451461576] [2024-11-21 22:05:17,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 22:05:17,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 22:05:17,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:17,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 22:05:17,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-21 22:05:17,375 INFO L87 Difference]: Start difference. First operand 4853 states and 5943 transitions. Second operand has 8 states, 8 states have (on average 74.75) internal successors, (598), 7 states have internal predecessors, (598), 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:05:19,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:19,370 INFO L93 Difference]: Finished difference Result 13800 states and 16837 transitions. [2024-11-21 22:05:19,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 22:05:19,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 74.75) internal successors, (598), 7 states have internal predecessors, (598), 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 336 [2024-11-21 22:05:19,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:19,391 INFO L225 Difference]: With dead ends: 13800 [2024-11-21 22:05:19,391 INFO L226 Difference]: Without dead ends: 8949 [2024-11-21 22:05:19,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-21 22:05:19,397 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 864 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 3481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:19,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 192 Invalid, 3481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-21 22:05:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8949 states. [2024-11-21 22:05:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8949 to 5035. [2024-11-21 22:05:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5035 states, 5034 states have (on average 1.22248708780294) internal successors, (6154), 5034 states have internal predecessors, (6154), 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:05:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 6154 transitions. [2024-11-21 22:05:19,519 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 6154 transitions. Word has length 336 [2024-11-21 22:05:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:19,519 INFO L471 AbstractCegarLoop]: Abstraction has 5035 states and 6154 transitions. [2024-11-21 22:05:19,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 74.75) internal successors, (598), 7 states have internal predecessors, (598), 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:05:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 6154 transitions. [2024-11-21 22:05:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-11-21 22:05:19,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:19,529 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:19,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-21 22:05:19,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-21 22:05:19,734 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:19,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:19,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1398734134, now seen corresponding path program 1 times [2024-11-21 22:05:19,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:19,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419217925] [2024-11-21 22:05:19,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:19,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:05:20,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:20,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419217925] [2024-11-21 22:05:20,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419217925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:20,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:20,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 22:05:20,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642203206] [2024-11-21 22:05:20,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:20,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:05:20,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:20,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:05:20,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:20,124 INFO L87 Difference]: Start difference. First operand 5035 states and 6154 transitions. Second operand has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 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:05:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:21,037 INFO L93 Difference]: Finished difference Result 13948 states and 17066 transitions. [2024-11-21 22:05:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:05:21,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 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 357 [2024-11-21 22:05:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:21,049 INFO L225 Difference]: With dead ends: 13948 [2024-11-21 22:05:21,049 INFO L226 Difference]: Without dead ends: 8915 [2024-11-21 22:05:21,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:21,053 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 238 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:21,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 65 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-21 22:05:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8915 states. [2024-11-21 22:05:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8915 to 7441. [2024-11-21 22:05:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7441 states, 7440 states have (on average 1.1923387096774194) internal successors, (8871), 7440 states have internal predecessors, (8871), 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:05:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 8871 transitions. [2024-11-21 22:05:21,139 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 8871 transitions. Word has length 357 [2024-11-21 22:05:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:21,140 INFO L471 AbstractCegarLoop]: Abstraction has 7441 states and 8871 transitions. [2024-11-21 22:05:21,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 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:05:21,140 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 8871 transitions. [2024-11-21 22:05:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2024-11-21 22:05:21,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:21,150 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:21,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 22:05:21,150 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:21,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:21,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1218780311, now seen corresponding path program 1 times [2024-11-21 22:05:21,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439595875] [2024-11-21 22:05:21,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:21,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-21 22:05:21,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:21,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439595875] [2024-11-21 22:05:21,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439595875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:21,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:21,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 22:05:21,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029608429] [2024-11-21 22:05:21,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:21,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:05:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:21,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:05:21,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:21,459 INFO L87 Difference]: Start difference. First operand 7441 states and 8871 transitions. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 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:05:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:22,305 INFO L93 Difference]: Finished difference Result 16170 states and 19194 transitions. [2024-11-21 22:05:22,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:05:22,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 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 431 [2024-11-21 22:05:22,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:22,317 INFO L225 Difference]: With dead ends: 16170 [2024-11-21 22:05:22,318 INFO L226 Difference]: Without dead ends: 8731 [2024-11-21 22:05:22,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:22,324 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 239 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:22,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 64 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 22:05:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8731 states. [2024-11-21 22:05:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8731 to 7441. [2024-11-21 22:05:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7441 states, 7440 states have (on average 1.1923387096774194) internal successors, (8871), 7440 states have internal predecessors, (8871), 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:05:22,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 8871 transitions. [2024-11-21 22:05:22,399 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 8871 transitions. Word has length 431 [2024-11-21 22:05:22,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:22,399 INFO L471 AbstractCegarLoop]: Abstraction has 7441 states and 8871 transitions. [2024-11-21 22:05:22,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 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:05:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 8871 transitions. [2024-11-21 22:05:22,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2024-11-21 22:05:22,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:22,409 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:22,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 22:05:22,409 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:22,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash -287893398, now seen corresponding path program 1 times [2024-11-21 22:05:22,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:22,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453384166] [2024-11-21 22:05:22,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:22,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-21 22:05:22,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:22,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453384166] [2024-11-21 22:05:22,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453384166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:22,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:22,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:22,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316149208] [2024-11-21 22:05:22,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:22,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:22,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:22,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:22,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:22,629 INFO L87 Difference]: Start difference. First operand 7441 states and 8871 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:05:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:23,121 INFO L93 Difference]: Finished difference Result 15080 states and 17958 transitions. [2024-11-21 22:05:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:23,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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 431 [2024-11-21 22:05:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:23,131 INFO L225 Difference]: With dead ends: 15080 [2024-11-21 22:05:23,132 INFO L226 Difference]: Without dead ends: 7641 [2024-11-21 22:05:23,137 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:05:23,137 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 107 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:23,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 329 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:05:23,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7641 states. [2024-11-21 22:05:23,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7641 to 7257. [2024-11-21 22:05:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7257 states, 7256 states have (on average 1.160005512679162) internal successors, (8417), 7256 states have internal predecessors, (8417), 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:05:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 8417 transitions. [2024-11-21 22:05:23,200 INFO L78 Accepts]: Start accepts. Automaton has 7257 states and 8417 transitions. Word has length 431 [2024-11-21 22:05:23,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:23,201 INFO L471 AbstractCegarLoop]: Abstraction has 7257 states and 8417 transitions. [2024-11-21 22:05:23,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:05:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 7257 states and 8417 transitions. [2024-11-21 22:05:23,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2024-11-21 22:05:23,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:23,208 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:23,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 22:05:23,208 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:23,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:23,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2057046030, now seen corresponding path program 1 times [2024-11-21 22:05:23,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:23,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153699295] [2024-11-21 22:05:23,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-21 22:05:23,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:23,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153699295] [2024-11-21 22:05:23,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153699295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:23,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:23,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:05:23,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647097476] [2024-11-21 22:05:23,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:23,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:23,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:23,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:23,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:23,439 INFO L87 Difference]: Start difference. First operand 7257 states and 8417 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 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:05:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:23,689 INFO L93 Difference]: Finished difference Result 14132 states and 16360 transitions. [2024-11-21 22:05:23,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:23,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 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 488 [2024-11-21 22:05:23,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:23,698 INFO L225 Difference]: With dead ends: 14132 [2024-11-21 22:05:23,698 INFO L226 Difference]: Without dead ends: 6877 [2024-11-21 22:05:23,703 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:05:23,704 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:23,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 37 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 22:05:23,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6877 states. [2024-11-21 22:05:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6877 to 6875. [2024-11-21 22:05:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6875 states, 6874 states have (on average 1.1544951993017165) internal successors, (7936), 6874 states have internal predecessors, (7936), 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:05:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 7936 transitions. [2024-11-21 22:05:23,760 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 7936 transitions. Word has length 488 [2024-11-21 22:05:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:23,761 INFO L471 AbstractCegarLoop]: Abstraction has 6875 states and 7936 transitions. [2024-11-21 22:05:23,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 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:05:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 7936 transitions. [2024-11-21 22:05:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-11-21 22:05:23,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:23,768 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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:05:23,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-21 22:05:23,768 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:23,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:23,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1680894984, now seen corresponding path program 1 times [2024-11-21 22:05:23,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:23,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528029868] [2024-11-21 22:05:23,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:23,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-21 22:05:24,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:24,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528029868] [2024-11-21 22:05:24,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528029868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:24,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:24,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:24,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625207917] [2024-11-21 22:05:24,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:24,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:24,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:24,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:24,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:24,041 INFO L87 Difference]: Start difference. First operand 6875 states and 7936 transitions. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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:05:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:24,432 INFO L93 Difference]: Finished difference Result 12621 states and 14535 transitions. [2024-11-21 22:05:24,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:24,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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 504 [2024-11-21 22:05:24,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:24,438 INFO L225 Difference]: With dead ends: 12621 [2024-11-21 22:05:24,438 INFO L226 Difference]: Without dead ends: 5748 [2024-11-21 22:05:24,442 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:05:24,443 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:24,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 123 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:05:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5748 states. [2024-11-21 22:05:24,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5748 to 4828. [2024-11-21 22:05:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4828 states, 4827 states have (on average 1.1247151439817693) internal successors, (5429), 4827 states have internal predecessors, (5429), 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:05:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4828 states to 4828 states and 5429 transitions. [2024-11-21 22:05:24,482 INFO L78 Accepts]: Start accepts. Automaton has 4828 states and 5429 transitions. Word has length 504 [2024-11-21 22:05:24,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:24,482 INFO L471 AbstractCegarLoop]: Abstraction has 4828 states and 5429 transitions. [2024-11-21 22:05:24,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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:05:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 4828 states and 5429 transitions. [2024-11-21 22:05:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2024-11-21 22:05:24,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:24,490 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-21 22:05:24,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-21 22:05:24,490 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:24,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:24,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1417577515, now seen corresponding path program 1 times [2024-11-21 22:05:24,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:24,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662894773] [2024-11-21 22:05:24,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:24,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1298 backedges. 872 proven. 0 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-21 22:05:24,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:24,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662894773] [2024-11-21 22:05:24,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662894773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:24,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:24,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:24,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20622651] [2024-11-21 22:05:24,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:24,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:05:24,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:24,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:05:24,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:24,801 INFO L87 Difference]: Start difference. First operand 4828 states and 5429 transitions. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 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:05:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:25,540 INFO L93 Difference]: Finished difference Result 14635 states and 16469 transitions. [2024-11-21 22:05:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:05:25,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 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 682 [2024-11-21 22:05:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:25,549 INFO L225 Difference]: With dead ends: 14635 [2024-11-21 22:05:25,549 INFO L226 Difference]: Without dead ends: 9809 [2024-11-21 22:05:25,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:05:25,555 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 215 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:25,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 54 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 22:05:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9809 states. [2024-11-21 22:05:25,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9809 to 9620. [2024-11-21 22:05:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9620 states, 9619 states have (on average 1.1143570017673354) internal successors, (10719), 9619 states have internal predecessors, (10719), 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:05:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9620 states to 9620 states and 10719 transitions. [2024-11-21 22:05:25,637 INFO L78 Accepts]: Start accepts. Automaton has 9620 states and 10719 transitions. Word has length 682 [2024-11-21 22:05:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:25,638 INFO L471 AbstractCegarLoop]: Abstraction has 9620 states and 10719 transitions. [2024-11-21 22:05:25,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 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:05:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 9620 states and 10719 transitions. [2024-11-21 22:05:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2024-11-21 22:05:25,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:25,649 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-11-21 22:05:25,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-21 22:05:25,649 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:25,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:25,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1921349717, now seen corresponding path program 1 times [2024-11-21 22:05:25,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:25,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353171773] [2024-11-21 22:05:25,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:25,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 1023 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2024-11-21 22:05:25,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:25,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353171773] [2024-11-21 22:05:25,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353171773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:25,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:25,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:25,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946420341] [2024-11-21 22:05:25,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:25,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:25,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:25,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:25,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:25,945 INFO L87 Difference]: Start difference. First operand 9620 states and 10719 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:05:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:26,417 INFO L93 Difference]: Finished difference Result 20341 states and 22719 transitions. [2024-11-21 22:05:26,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:26,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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 760 [2024-11-21 22:05:26,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:26,425 INFO L225 Difference]: With dead ends: 20341 [2024-11-21 22:05:26,426 INFO L226 Difference]: Without dead ends: 10170 [2024-11-21 22:05:26,432 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:05:26,432 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 194 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:26,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 340 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:05:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10170 states. [2024-11-21 22:05:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10170 to 10170. [2024-11-21 22:05:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10170 states, 10169 states have (on average 1.0946995771462287) internal successors, (11132), 10169 states have internal predecessors, (11132), 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:05:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10170 states to 10170 states and 11132 transitions. [2024-11-21 22:05:26,517 INFO L78 Accepts]: Start accepts. Automaton has 10170 states and 11132 transitions. Word has length 760 [2024-11-21 22:05:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:26,518 INFO L471 AbstractCegarLoop]: Abstraction has 10170 states and 11132 transitions. [2024-11-21 22:05:26,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:05:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 10170 states and 11132 transitions. [2024-11-21 22:05:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2024-11-21 22:05:26,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:05:26,530 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2024-11-21 22:05:26,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-21 22:05:26,530 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:05:26,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:05:26,530 INFO L85 PathProgramCache]: Analyzing trace with hash -43670685, now seen corresponding path program 1 times [2024-11-21 22:05:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:05:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84393217] [2024-11-21 22:05:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:05:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:05:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:05:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 1501 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-21 22:05:26,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:05:26,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84393217] [2024-11-21 22:05:26,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84393217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:05:26,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:05:26,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:05:26,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575261002] [2024-11-21 22:05:26,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:05:26,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:05:26,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:05:26,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:05:26,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:05:26,869 INFO L87 Difference]: Start difference. First operand 10170 states and 11132 transitions. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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:05:27,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:05:27,317 INFO L93 Difference]: Finished difference Result 20887 states and 22855 transitions. [2024-11-21 22:05:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:05:27,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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 850 [2024-11-21 22:05:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:05:27,318 INFO L225 Difference]: With dead ends: 20887 [2024-11-21 22:05:27,318 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 22:05:27,325 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:05:27,326 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 53 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:05:27,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 320 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:05:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 22:05:27,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 22:05:27,327 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:05:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 22:05:27,327 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 850 [2024-11-21 22:05:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:05:27,327 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 22:05:27,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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:05:27,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 22:05:27,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 22:05:27,330 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 22:05:27,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-21 22:05:27,336 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:05:27,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 22:05:29,058 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 22:05:29,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:05:29 BoogieIcfgContainer [2024-11-21 22:05:29,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 22:05:29,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 22:05:29,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 22:05:29,081 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 22:05:29,082 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:05:05" (3/4) ... [2024-11-21 22:05:29,084 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 22:05:29,101 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 22:05:29,103 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 22:05:29,104 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 22:05:29,105 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 22:05:29,233 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 22:05:29,233 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 22:05:29,233 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 22:05:29,235 INFO L158 Benchmark]: Toolchain (without parser) took 25368.13ms. Allocated memory was 153.1MB in the beginning and 935.3MB in the end (delta: 782.2MB). Free memory was 122.8MB in the beginning and 494.1MB in the end (delta: -371.3MB). Peak memory consumption was 411.6MB. Max. memory is 16.1GB. [2024-11-21 22:05:29,236 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 153.1MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 22:05:29,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.35ms. Allocated memory is still 153.1MB. Free memory was 122.4MB in the beginning and 75.1MB in the end (delta: 47.3MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-21 22:05:29,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.57ms. Allocated memory is still 153.1MB. Free memory was 75.1MB in the beginning and 111.9MB in the end (delta: -36.8MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2024-11-21 22:05:29,237 INFO L158 Benchmark]: Boogie Preprocessor took 185.13ms. Allocated memory was 153.1MB in the beginning and 234.9MB in the end (delta: 81.8MB). Free memory was 111.9MB in the beginning and 169.9MB in the end (delta: -58.0MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2024-11-21 22:05:29,237 INFO L158 Benchmark]: RCFGBuilder took 1214.88ms. Allocated memory is still 234.9MB. Free memory was 169.9MB in the beginning and 95.9MB in the end (delta: 74.0MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2024-11-21 22:05:29,237 INFO L158 Benchmark]: TraceAbstraction took 23182.22ms. Allocated memory was 234.9MB in the beginning and 935.3MB in the end (delta: 700.4MB). Free memory was 95.9MB in the beginning and 510.9MB in the end (delta: -415.0MB). Peak memory consumption was 490.3MB. Max. memory is 16.1GB. [2024-11-21 22:05:29,240 INFO L158 Benchmark]: Witness Printer took 153.12ms. Allocated memory is still 935.3MB. Free memory was 510.9MB in the beginning and 494.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-21 22:05:29,240 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.16ms. Allocated memory is still 153.1MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.35ms. Allocated memory is still 153.1MB. Free memory was 122.4MB in the beginning and 75.1MB in the end (delta: 47.3MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.57ms. Allocated memory is still 153.1MB. Free memory was 75.1MB in the beginning and 111.9MB in the end (delta: -36.8MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 185.13ms. Allocated memory was 153.1MB in the beginning and 234.9MB in the end (delta: 81.8MB). Free memory was 111.9MB in the beginning and 169.9MB in the end (delta: -58.0MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1214.88ms. Allocated memory is still 234.9MB. Free memory was 169.9MB in the beginning and 95.9MB in the end (delta: 74.0MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * TraceAbstraction took 23182.22ms. Allocated memory was 234.9MB in the beginning and 935.3MB in the end (delta: 700.4MB). Free memory was 95.9MB in the beginning and 510.9MB in the end (delta: -415.0MB). Peak memory consumption was 490.3MB. Max. memory is 16.1GB. * Witness Printer took 153.12ms. Allocated memory is still 935.3MB. Free memory was 510.9MB in the beginning and 494.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 172]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.4s, OverallIterations: 17, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3409 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3409 mSDsluCounter, 3456 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 428 mSDsCounter, 2176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13085 IncrementalHoareTripleChecker+Invalid, 15261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2176 mSolverCounterUnsat, 3028 mSDtfsCounter, 13085 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 969 GetRequests, 932 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10170occurred in iteration=16, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 9684 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 6950 NumberOfCodeBlocks, 6950 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 7266 ConstructedInterpolants, 0 QuantifiedInterpolants, 24163 SizeOfPredicates, 8 NumberOfNonLiveVariables, 797 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 9112/9275 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a25 <= 10) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) || ((((a25 == 11) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 599998)) && (a8 == 15))) || ((((a25 == 13) && (a29 <= 245)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 == 13) && (307 <= a23)) || ((a25 == 13) && (a3 == 1))) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 11) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 <= 10) && (a3 == 1)) && (a23 <= 138)) && (a4 == 1)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((a25 <= 10) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || (((((a4 == 0) && (a25 == 11)) && (a29 <= 599998)) && (a23 <= 312)) && (a8 == 15))) || ((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a25 <= 10)) && (a8 == 15))) || (((((((long long) a29 + 21) <= 0) && (a25 == 12)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a4 == 1)) && (a8 == 15))) || (((((a4 == 0) && (a25 <= 10)) && (a29 <= 245)) && (a23 <= 138)) && (a8 == 15))) || ((((((a25 == 12) && (307 <= a23)) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2024-11-21 22:05:29,254 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