./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label05.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 e02cb01095391f043ac338e051aad38ada321e317716e1cbc4cb781d100f4706 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:36:33,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:36:33,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:36:33,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:36:33,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:36:33,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:36:33,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:36:33,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:36:33,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:36:33,758 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:36:33,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:36:33,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:36:33,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:36:33,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:36:33,760 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:36:33,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:36:33,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:36:33,763 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:36:33,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:36:33,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:36:33,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:36:33,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:36:33,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:36:33,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:36:33,768 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:36:33,768 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:36:33,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:36:33,769 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:36:33,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:36:33,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:36:33,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:36:33,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:36:33,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:36:33,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:36:33,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:36:33,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:36:33,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:36:33,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:36:33,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:36:33,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:36:33,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:36:33,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:36:33,774 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 -> e02cb01095391f043ac338e051aad38ada321e317716e1cbc4cb781d100f4706 [2024-11-09 19:36:34,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:36:34,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:36:34,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:36:34,056 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:36:34,057 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:36:34,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label05.c [2024-11-09 19:36:35,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:36:35,725 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:36:35,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label05.c [2024-11-09 19:36:35,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b697e0a8c/8320eb7baa594bd09f5da3a37f8cbd71/FLAG7d94de996 [2024-11-09 19:36:36,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b697e0a8c/8320eb7baa594bd09f5da3a37f8cbd71 [2024-11-09 19:36:36,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:36:36,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:36:36,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:36:36,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:36:36,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:36:36,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:36:36" (1/1) ... [2024-11-09 19:36:36,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@176e8f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36, skipping insertion in model container [2024-11-09 19:36:36,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:36:36" (1/1) ... [2024-11-09 19:36:36,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:36:36,339 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/Problem14_label05.c[6428,6441] [2024-11-09 19:36:36,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:36:36,515 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:36:36,570 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/Problem14_label05.c[6428,6441] [2024-11-09 19:36:36,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:36:36,788 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:36:36,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36 WrapperNode [2024-11-09 19:36:36,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:36:36,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:36:36,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:36:36,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:36:36,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36" (1/1) ... [2024-11-09 19:36:36,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36" (1/1) ... [2024-11-09 19:36:36,887 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 858 [2024-11-09 19:36:36,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:36:36,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:36:36,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:36:36,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:36:36,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36" (1/1) ... [2024-11-09 19:36:36,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36" (1/1) ... [2024-11-09 19:36:36,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36" (1/1) ... [2024-11-09 19:36:36,944 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-09 19:36:36,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36" (1/1) ... [2024-11-09 19:36:36,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36" (1/1) ... [2024-11-09 19:36:36,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36" (1/1) ... [2024-11-09 19:36:36,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36" (1/1) ... [2024-11-09 19:36:36,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36" (1/1) ... [2024-11-09 19:36:36,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36" (1/1) ... [2024-11-09 19:36:36,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:36:37,000 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:36:37,000 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:36:37,000 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:36:37,001 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36" (1/1) ... [2024-11-09 19:36:37,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:36:37,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:36:37,034 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-09 19:36:37,038 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-09 19:36:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:36:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:36:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:36:37,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:36:37,160 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:36:37,162 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:36:38,597 INFO L? ?]: Removed 236 outVars from TransFormulas that were not future-live. [2024-11-09 19:36:38,597 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:36:38,621 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:36:38,622 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:36:38,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:36:38 BoogieIcfgContainer [2024-11-09 19:36:38,623 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:36:38,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:36:38,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:36:38,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:36:38,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:36:36" (1/3) ... [2024-11-09 19:36:38,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450f49eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:36:38, skipping insertion in model container [2024-11-09 19:36:38,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:36" (2/3) ... [2024-11-09 19:36:38,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450f49eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:36:38, skipping insertion in model container [2024-11-09 19:36:38,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:36:38" (3/3) ... [2024-11-09 19:36:38,632 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label05.c [2024-11-09 19:36:38,651 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:36:38,652 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:36:38,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:36:38,729 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;@5f2ff528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:36:38,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:36:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 248 states, 246 states have (on average 2.186991869918699) internal successors, (538), 247 states have internal predecessors, (538), 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-09 19:36:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 19:36:38,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:38,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:38,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:38,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:38,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1460375250, now seen corresponding path program 1 times [2024-11-09 19:36:38,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:38,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530848594] [2024-11-09 19:36:38,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:38,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:39,294 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-09 19:36:39,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:39,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530848594] [2024-11-09 19:36:39,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530848594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:39,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:39,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:39,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820773481] [2024-11-09 19:36:39,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:39,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:36:39,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:39,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:36:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:36:39,332 INFO L87 Difference]: Start difference. First operand has 248 states, 246 states have (on average 2.186991869918699) internal successors, (538), 247 states have internal predecessors, (538), 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 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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-09 19:36:41,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:41,389 INFO L93 Difference]: Finished difference Result 859 states and 2019 transitions. [2024-11-09 19:36:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:36:41,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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 65 [2024-11-09 19:36:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:41,405 INFO L225 Difference]: With dead ends: 859 [2024-11-09 19:36:41,405 INFO L226 Difference]: Without dead ends: 542 [2024-11-09 19:36:41,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:36:41,411 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 822 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:41,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 199 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:36:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-09 19:36:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2024-11-09 19:36:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 2.0720887245841033) internal successors, (1121), 541 states have internal predecessors, (1121), 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-09 19:36:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1121 transitions. [2024-11-09 19:36:41,487 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1121 transitions. Word has length 65 [2024-11-09 19:36:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:41,488 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 1121 transitions. [2024-11-09 19:36:41,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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-09 19:36:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1121 transitions. [2024-11-09 19:36:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 19:36:41,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:41,493 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, 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-09 19:36:41,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:36:41,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:41,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:41,494 INFO L85 PathProgramCache]: Analyzing trace with hash 753123019, now seen corresponding path program 1 times [2024-11-09 19:36:41,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:41,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635081418] [2024-11-09 19:36:41,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:41,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:36:41,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:41,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635081418] [2024-11-09 19:36:41,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635081418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:41,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:41,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:36:41,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061418075] [2024-11-09 19:36:41,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:41,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:41,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:41,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:41,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:36:41,721 INFO L87 Difference]: Start difference. First operand 542 states and 1121 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-09 19:36:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:42,559 INFO L93 Difference]: Finished difference Result 1082 states and 2342 transitions. [2024-11-09 19:36:42,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:42,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 132 [2024-11-09 19:36:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:42,563 INFO L225 Difference]: With dead ends: 1082 [2024-11-09 19:36:42,563 INFO L226 Difference]: Without dead ends: 721 [2024-11-09 19:36:42,564 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-09 19:36:42,565 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 239 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:42,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 60 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:36:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-09 19:36:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2024-11-09 19:36:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 1.9791666666666667) internal successors, (1425), 720 states have internal predecessors, (1425), 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-09 19:36:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1425 transitions. [2024-11-09 19:36:42,610 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1425 transitions. Word has length 132 [2024-11-09 19:36:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:42,611 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1425 transitions. [2024-11-09 19:36:42,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-09 19:36:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1425 transitions. [2024-11-09 19:36:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 19:36:42,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:42,614 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, 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-09 19:36:42,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:36:42,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:42,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:42,617 INFO L85 PathProgramCache]: Analyzing trace with hash -120518411, now seen corresponding path program 1 times [2024-11-09 19:36:42,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:42,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456456989] [2024-11-09 19:36:42,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:42,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:36:42,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:42,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456456989] [2024-11-09 19:36:42,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456456989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:42,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:42,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:42,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427601092] [2024-11-09 19:36:42,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:42,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:36:42,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:42,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:36:42,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:36:42,902 INFO L87 Difference]: Start difference. First operand 721 states and 1425 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 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-09 19:36:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:43,954 INFO L93 Difference]: Finished difference Result 1649 states and 3297 transitions. [2024-11-09 19:36:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:36:43,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 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 146 [2024-11-09 19:36:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:43,962 INFO L225 Difference]: With dead ends: 1649 [2024-11-09 19:36:43,962 INFO L226 Difference]: Without dead ends: 1079 [2024-11-09 19:36:43,963 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-09 19:36:43,964 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 214 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:43,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 121 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:36:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2024-11-09 19:36:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 900. [2024-11-09 19:36:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 1.799777530589544) internal successors, (1618), 899 states have internal predecessors, (1618), 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-09 19:36:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1618 transitions. [2024-11-09 19:36:43,986 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1618 transitions. Word has length 146 [2024-11-09 19:36:43,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:43,989 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1618 transitions. [2024-11-09 19:36:43,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 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-09 19:36:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1618 transitions. [2024-11-09 19:36:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-11-09 19:36:44,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:44,002 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:44,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:36:44,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:44,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:44,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1222050731, now seen corresponding path program 1 times [2024-11-09 19:36:44,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:44,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513740735] [2024-11-09 19:36:44,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:44,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-09 19:36:44,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:44,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513740735] [2024-11-09 19:36:44,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513740735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:44,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:44,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:44,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373669618] [2024-11-09 19:36:44,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:44,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:44,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:44,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:44,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:36:44,478 INFO L87 Difference]: Start difference. First operand 900 states and 1618 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-09 19:36:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:45,235 INFO L93 Difference]: Finished difference Result 2156 states and 3967 transitions. [2024-11-09 19:36:45,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:45,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 348 [2024-11-09 19:36:45,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:45,242 INFO L225 Difference]: With dead ends: 2156 [2024-11-09 19:36:45,242 INFO L226 Difference]: Without dead ends: 1437 [2024-11-09 19:36:45,243 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-09 19:36:45,243 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 226 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:45,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 79 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:36:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2024-11-09 19:36:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1437. [2024-11-09 19:36:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1436 states have (on average 1.7715877437325904) internal successors, (2544), 1436 states have internal predecessors, (2544), 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-09 19:36:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2544 transitions. [2024-11-09 19:36:45,270 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2544 transitions. Word has length 348 [2024-11-09 19:36:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:45,271 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2544 transitions. [2024-11-09 19:36:45,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-09 19:36:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2544 transitions. [2024-11-09 19:36:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-09 19:36:45,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:45,275 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:45,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:36:45,276 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:45,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash -996857691, now seen corresponding path program 1 times [2024-11-09 19:36:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:45,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23417951] [2024-11-09 19:36:45,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-11-09 19:36:45,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:45,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23417951] [2024-11-09 19:36:45,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23417951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:45,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:45,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:45,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417378670] [2024-11-09 19:36:45,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:45,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:36:45,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:45,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:36:45,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:36:45,659 INFO L87 Difference]: Start difference. First operand 1437 states and 2544 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 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-09 19:36:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:46,570 INFO L93 Difference]: Finished difference Result 2902 states and 5153 transitions. [2024-11-09 19:36:46,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:36:46,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 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 359 [2024-11-09 19:36:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:46,577 INFO L225 Difference]: With dead ends: 2902 [2024-11-09 19:36:46,577 INFO L226 Difference]: Without dead ends: 1616 [2024-11-09 19:36:46,579 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-09 19:36:46,581 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 255 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:46,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 23 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:36:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2024-11-09 19:36:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1437. [2024-11-09 19:36:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1436 states have (on average 1.7249303621169916) internal successors, (2477), 1436 states have internal predecessors, (2477), 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-09 19:36:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2477 transitions. [2024-11-09 19:36:46,610 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2477 transitions. Word has length 359 [2024-11-09 19:36:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:46,611 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2477 transitions. [2024-11-09 19:36:46,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 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-09 19:36:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2477 transitions. [2024-11-09 19:36:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-09 19:36:46,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:46,617 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, 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, 2, 2, 2, 2, 2, 2, 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-09 19:36:46,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:36:46,617 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:46,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash 505309341, now seen corresponding path program 1 times [2024-11-09 19:36:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:46,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176500641] [2024-11-09 19:36:46,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 345 proven. 23 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-09 19:36:47,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:47,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176500641] [2024-11-09 19:36:47,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176500641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:36:47,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151689070] [2024-11-09 19:36:47,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:47,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:47,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:36:47,221 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-09 19:36:47,228 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-09 19:36:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:47,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:36:47,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:36:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-09 19:36:47,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:36:47,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151689070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:47,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:36:47,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:36:47,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023168493] [2024-11-09 19:36:47,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:47,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:47,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:47,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:47,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:47,527 INFO L87 Difference]: Start difference. First operand 1437 states and 2477 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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-09 19:36:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:48,265 INFO L93 Difference]: Finished difference Result 3409 states and 5936 transitions. [2024-11-09 19:36:48,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:48,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 372 [2024-11-09 19:36:48,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:48,274 INFO L225 Difference]: With dead ends: 3409 [2024-11-09 19:36:48,275 INFO L226 Difference]: Without dead ends: 2153 [2024-11-09 19:36:48,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:48,277 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 231 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:48,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 365 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:36:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2024-11-09 19:36:48,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 1974. [2024-11-09 19:36:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1973 states have (on average 1.7197161682716675) internal successors, (3393), 1973 states have internal predecessors, (3393), 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-09 19:36:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 3393 transitions. [2024-11-09 19:36:48,311 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 3393 transitions. Word has length 372 [2024-11-09 19:36:48,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:48,312 INFO L471 AbstractCegarLoop]: Abstraction has 1974 states and 3393 transitions. [2024-11-09 19:36:48,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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-09 19:36:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 3393 transitions. [2024-11-09 19:36:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2024-11-09 19:36:48,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:48,320 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:48,338 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-09 19:36:48,520 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-09 19:36:48,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:48,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:48,521 INFO L85 PathProgramCache]: Analyzing trace with hash 121162226, now seen corresponding path program 1 times [2024-11-09 19:36:48,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:48,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947462122] [2024-11-09 19:36:48,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:48,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 612 proven. 23 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 19:36:49,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:49,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947462122] [2024-11-09 19:36:49,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947462122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:36:49,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269199661] [2024-11-09 19:36:49,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:49,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:49,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:36:49,137 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-09 19:36:49,138 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-09 19:36:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:49,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:36:49,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:36:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2024-11-09 19:36:49,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:36:49,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269199661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:49,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:36:49,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:36:49,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260270615] [2024-11-09 19:36:49,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:49,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:49,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:49,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:49,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:49,409 INFO L87 Difference]: Start difference. First operand 1974 states and 3393 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-09 19:36:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:50,217 INFO L93 Difference]: Finished difference Result 4483 states and 7778 transitions. [2024-11-09 19:36:50,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:50,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 507 [2024-11-09 19:36:50,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:50,231 INFO L225 Difference]: With dead ends: 4483 [2024-11-09 19:36:50,231 INFO L226 Difference]: Without dead ends: 2690 [2024-11-09 19:36:50,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:50,235 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 241 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:50,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 325 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:36:50,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-09 19:36:50,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2511. [2024-11-09 19:36:50,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2510 states have (on average 1.7266932270916335) internal successors, (4334), 2510 states have internal predecessors, (4334), 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-09 19:36:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 4334 transitions. [2024-11-09 19:36:50,297 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 4334 transitions. Word has length 507 [2024-11-09 19:36:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:50,298 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 4334 transitions. [2024-11-09 19:36:50,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-09 19:36:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 4334 transitions. [2024-11-09 19:36:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2024-11-09 19:36:50,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:50,307 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:50,324 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-09 19:36:50,508 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,SelfDestructingSolverStorable6 [2024-11-09 19:36:50,509 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:50,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:50,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1825229900, now seen corresponding path program 1 times [2024-11-09 19:36:50,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:50,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255158586] [2024-11-09 19:36:50,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:50,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 653 proven. 23 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2024-11-09 19:36:51,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:51,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255158586] [2024-11-09 19:36:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255158586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:36:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717856683] [2024-11-09 19:36:51,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:51,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:51,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:36:51,116 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:36:51,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:36:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:51,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:36:51,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:36:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2024-11-09 19:36:51,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:36:51,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717856683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:51,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:36:51,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:36:51,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289222712] [2024-11-09 19:36:51,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:51,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:51,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:51,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:51,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:51,409 INFO L87 Difference]: Start difference. First operand 2511 states and 4334 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-09 19:36:52,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:52,043 INFO L93 Difference]: Finished difference Result 5733 states and 9977 transitions. [2024-11-09 19:36:52,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:52,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 537 [2024-11-09 19:36:52,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:52,045 INFO L225 Difference]: With dead ends: 5733 [2024-11-09 19:36:52,045 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:36:52,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:52,051 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 231 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:52,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 347 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:36:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:36:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:36:52,052 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-09 19:36:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:36:52,052 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 537 [2024-11-09 19:36:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:52,053 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:36:52,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-09 19:36:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:36:52,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:36:52,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:36:52,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 19:36:52,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:52,260 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:52,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:36:52,447 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:36:52,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:36:52 BoogieIcfgContainer [2024-11-09 19:36:52,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:36:52,464 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:36:52,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:36:52,465 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:36:52,465 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:36:38" (3/4) ... [2024-11-09 19:36:52,472 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:36:52,495 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:36:52,496 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:36:52,498 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:36:52,499 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:36:52,700 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:36:52,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:36:52,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:36:52,702 INFO L158 Benchmark]: Toolchain (without parser) took 16650.35ms. Allocated memory was 146.8MB in the beginning and 377.5MB in the end (delta: 230.7MB). Free memory was 88.3MB in the beginning and 177.9MB in the end (delta: -89.6MB). Peak memory consumption was 142.4MB. Max. memory is 16.1GB. [2024-11-09 19:36:52,703 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 107.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:36:52,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.06ms. Allocated memory is still 146.8MB. Free memory was 88.3MB in the beginning and 106.6MB in the end (delta: -18.3MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-11-09 19:36:52,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.58ms. Allocated memory is still 146.8MB. Free memory was 106.6MB in the beginning and 96.8MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 19:36:52,703 INFO L158 Benchmark]: Boogie Preprocessor took 110.99ms. Allocated memory is still 146.8MB. Free memory was 96.1MB in the beginning and 84.9MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 19:36:52,704 INFO L158 Benchmark]: IcfgBuilder took 1622.77ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 84.9MB in the beginning and 167.7MB in the end (delta: -82.8MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. [2024-11-09 19:36:52,704 INFO L158 Benchmark]: TraceAbstraction took 13839.17ms. Allocated memory was 216.0MB in the beginning and 377.5MB in the end (delta: 161.5MB). Free memory was 166.6MB in the beginning and 195.8MB in the end (delta: -29.1MB). Peak memory consumption was 131.3MB. Max. memory is 16.1GB. [2024-11-09 19:36:52,704 INFO L158 Benchmark]: Witness Printer took 237.43ms. Allocated memory is still 377.5MB. Free memory was 195.8MB in the beginning and 177.9MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 19:36:52,706 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.19ms. Allocated memory is still 146.8MB. Free memory is still 107.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.06ms. Allocated memory is still 146.8MB. Free memory was 88.3MB in the beginning and 106.6MB in the end (delta: -18.3MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.58ms. Allocated memory is still 146.8MB. Free memory was 106.6MB in the beginning and 96.8MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.99ms. Allocated memory is still 146.8MB. Free memory was 96.1MB in the beginning and 84.9MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1622.77ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 84.9MB in the beginning and 167.7MB in the end (delta: -82.8MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13839.17ms. Allocated memory was 216.0MB in the beginning and 377.5MB in the end (delta: 161.5MB). Free memory was 166.6MB in the beginning and 195.8MB in the end (delta: -29.1MB). Peak memory consumption was 131.3MB. Max. memory is 16.1GB. * Witness Printer took 237.43ms. Allocated memory is still 377.5MB. Free memory was 195.8MB in the beginning and 177.9MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. 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: 203]: 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, 248 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2459 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2459 mSDsluCounter, 1519 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 836 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7184 IncrementalHoareTripleChecker+Invalid, 8020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 836 mSolverCounterUnsat, 1443 mSDtfsCounter, 7184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1440 GetRequests, 1419 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2511occurred in iteration=7, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 716 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 3882 NumberOfCodeBlocks, 3882 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3871 ConstructedInterpolants, 0 QuantifiedInterpolants, 14668 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1800 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 5321/5390 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: 890]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:36:52,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE