./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label29.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 372b0f8557f493ed9d29c5f8057b8dc54ad330866696fd4878e863a88379edbf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:37:35,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:37:35,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:37:35,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:37:35,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:37:35,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:37:35,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:37:35,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:37:35,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:37:35,839 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:37:35,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:37:35,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:37:35,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:37:35,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:37:35,842 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:37:35,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:37:35,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:37:35,843 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:37:35,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:37:35,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:37:35,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:37:35,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:37:35,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:37:35,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:37:35,847 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:37:35,848 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:37:35,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:37:35,848 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:37:35,849 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:37:35,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:37:35,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:37:35,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:37:35,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:37:35,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:37:35,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:37:35,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:37:35,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:37:35,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:37:35,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:37:35,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:37:35,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:37:35,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:37:35,855 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-clean/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-clean/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 -> 372b0f8557f493ed9d29c5f8057b8dc54ad330866696fd4878e863a88379edbf [2024-10-10 22:37:36,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:37:36,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:37:36,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:37:36,073 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:37:36,074 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:37:36,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label29.c [2024-10-10 22:37:37,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:37:37,714 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:37:37,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label29.c [2024-10-10 22:37:37,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/64ed4aabb/7ef3786a110e4ee0af11d96fa4ea8cbd/FLAG2ea5cd6f9 [2024-10-10 22:37:38,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/64ed4aabb/7ef3786a110e4ee0af11d96fa4ea8cbd [2024-10-10 22:37:38,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:37:38,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:37:38,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:37:38,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:37:38,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:37:38,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:37:38" (1/1) ... [2024-10-10 22:37:38,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba9930a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38, skipping insertion in model container [2024-10-10 22:37:38,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:37:38" (1/1) ... [2024-10-10 22:37:38,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:37:38,652 WARN L248 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/Problem03_label29.c[58258,58271] [2024-10-10 22:37:38,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:37:38,691 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:37:38,811 WARN L248 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/Problem03_label29.c[58258,58271] [2024-10-10 22:37:38,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:37:38,838 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:37:38,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38 WrapperNode [2024-10-10 22:37:38,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:37:38,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:37:38,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:37:38,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:37:38,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38" (1/1) ... [2024-10-10 22:37:38,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38" (1/1) ... [2024-10-10 22:37:38,961 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-10 22:37:38,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:37:38,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:37:38,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:37:38,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:37:38,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38" (1/1) ... [2024-10-10 22:37:38,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38" (1/1) ... [2024-10-10 22:37:38,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38" (1/1) ... [2024-10-10 22:37:39,020 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-10-10 22:37:39,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38" (1/1) ... [2024-10-10 22:37:39,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38" (1/1) ... [2024-10-10 22:37:39,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38" (1/1) ... [2024-10-10 22:37:39,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38" (1/1) ... [2024-10-10 22:37:39,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38" (1/1) ... [2024-10-10 22:37:39,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38" (1/1) ... [2024-10-10 22:37:39,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:37:39,104 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:37:39,104 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:37:39,104 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:37:39,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38" (1/1) ... [2024-10-10 22:37:39,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:37:39,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:39,142 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:37:39,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:37:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:37:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:37:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:37:39,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:37:39,277 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:37:39,279 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:37:40,802 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-10 22:37:40,803 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:37:40,860 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:37:40,861 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:37:40,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:37:40 BoogieIcfgContainer [2024-10-10 22:37:40,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:37:40,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:37:40,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:37:40,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:37:40,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:37:38" (1/3) ... [2024-10-10 22:37:40,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b43463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:37:40, skipping insertion in model container [2024-10-10 22:37:40,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:38" (2/3) ... [2024-10-10 22:37:40,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b43463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:37:40, skipping insertion in model container [2024-10-10 22:37:40,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:37:40" (3/3) ... [2024-10-10 22:37:40,868 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label29.c [2024-10-10 22:37:40,880 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:37:40,880 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:37:40,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:37:40,934 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;@6a996e7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:37:40,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:37:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 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-10-10 22:37:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-10 22:37:40,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:40,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:40,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:40,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1956184142, now seen corresponding path program 1 times [2024-10-10 22:37:40,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:40,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367322797] [2024-10-10 22:37:40,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:40,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:41,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:41,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367322797] [2024-10-10 22:37:41,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367322797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:41,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:41,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:41,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197104637] [2024-10-10 22:37:41,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:41,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:37:41,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:41,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:37:41,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:37:41,407 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 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 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 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-10-10 22:37:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:41,444 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-10 22:37:41,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:37:41,446 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 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 177 [2024-10-10 22:37:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:41,455 INFO L225 Difference]: With dead ends: 479 [2024-10-10 22:37:41,455 INFO L226 Difference]: Without dead ends: 238 [2024-10-10 22:37:41,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:37:41,460 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:41,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:37:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-10 22:37:41,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-10 22:37:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 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-10-10 22:37:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-10 22:37:41,495 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 177 [2024-10-10 22:37:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:41,496 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-10 22:37:41,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 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-10-10 22:37:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-10 22:37:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-10 22:37:41,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:41,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:41,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:37:41,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:41,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:41,500 INFO L85 PathProgramCache]: Analyzing trace with hash 312551751, now seen corresponding path program 1 times [2024-10-10 22:37:41,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:41,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769175629] [2024-10-10 22:37:41,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:41,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:41,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:41,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769175629] [2024-10-10 22:37:41,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769175629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:41,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:41,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:41,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494542584] [2024-10-10 22:37:41,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:41,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:41,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:41,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:41,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:41,950 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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-10-10 22:37:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:42,653 INFO L93 Difference]: Finished difference Result 686 states and 1135 transitions. [2024-10-10 22:37:42,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:42,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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 177 [2024-10-10 22:37:42,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:42,660 INFO L225 Difference]: With dead ends: 686 [2024-10-10 22:37:42,660 INFO L226 Difference]: Without dead ends: 449 [2024-10-10 22:37:42,661 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-10-10 22:37:42,664 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 100 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:42,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 90 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:42,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-10 22:37:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2024-10-10 22:37:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.6233183856502242) internal successors, (724), 446 states have internal predecessors, (724), 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-10-10 22:37:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 724 transitions. [2024-10-10 22:37:42,692 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 724 transitions. Word has length 177 [2024-10-10 22:37:42,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:42,693 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 724 transitions. [2024-10-10 22:37:42,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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-10-10 22:37:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 724 transitions. [2024-10-10 22:37:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-10 22:37:42,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:42,700 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:42,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:37:42,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:42,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:42,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1257221891, now seen corresponding path program 1 times [2024-10-10 22:37:42,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:42,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980384215] [2024-10-10 22:37:42,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:42,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:42,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:42,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980384215] [2024-10-10 22:37:42,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980384215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:42,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:42,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:42,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985918174] [2024-10-10 22:37:42,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:42,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:42,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:42,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:42,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:42,922 INFO L87 Difference]: Start difference. First operand 447 states and 724 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 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-10-10 22:37:43,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:43,659 INFO L93 Difference]: Finished difference Result 1317 states and 2138 transitions. [2024-10-10 22:37:43,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:43,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 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 182 [2024-10-10 22:37:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:43,663 INFO L225 Difference]: With dead ends: 1317 [2024-10-10 22:37:43,663 INFO L226 Difference]: Without dead ends: 871 [2024-10-10 22:37:43,664 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-10-10 22:37:43,665 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 251 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:43,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 156 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-10-10 22:37:43,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 867. [2024-10-10 22:37:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 1.5277136258660509) internal successors, (1323), 866 states have internal predecessors, (1323), 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-10-10 22:37:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1323 transitions. [2024-10-10 22:37:43,687 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1323 transitions. Word has length 182 [2024-10-10 22:37:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:43,688 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1323 transitions. [2024-10-10 22:37:43,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 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-10-10 22:37:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1323 transitions. [2024-10-10 22:37:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-10 22:37:43,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:43,691 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:43,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:37:43,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:43,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash -231125978, now seen corresponding path program 1 times [2024-10-10 22:37:43,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:43,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765385532] [2024-10-10 22:37:43,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:43,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:43,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:43,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765385532] [2024-10-10 22:37:43,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765385532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:43,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:43,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:43,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528835655] [2024-10-10 22:37:43,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:43,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:43,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:43,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:43,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:43,828 INFO L87 Difference]: Start difference. First operand 867 states and 1323 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 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-10-10 22:37:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:44,620 INFO L93 Difference]: Finished difference Result 2565 states and 3930 transitions. [2024-10-10 22:37:44,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:44,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 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 185 [2024-10-10 22:37:44,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:44,625 INFO L225 Difference]: With dead ends: 2565 [2024-10-10 22:37:44,626 INFO L226 Difference]: Without dead ends: 1699 [2024-10-10 22:37:44,627 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-10-10 22:37:44,628 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:44,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 90 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:37:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-10-10 22:37:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1683. [2024-10-10 22:37:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.497027348394768) internal successors, (2518), 1682 states have internal predecessors, (2518), 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-10-10 22:37:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2518 transitions. [2024-10-10 22:37:44,696 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2518 transitions. Word has length 185 [2024-10-10 22:37:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:44,697 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2518 transitions. [2024-10-10 22:37:44,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 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-10-10 22:37:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2518 transitions. [2024-10-10 22:37:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-10 22:37:44,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:44,705 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:44,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:37:44,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:44,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:44,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1155428621, now seen corresponding path program 1 times [2024-10-10 22:37:44,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:44,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029456969] [2024-10-10 22:37:44,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:44,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:44,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:44,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029456969] [2024-10-10 22:37:44,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029456969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:44,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:44,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:44,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638643189] [2024-10-10 22:37:44,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:44,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:44,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:44,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:44,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:44,898 INFO L87 Difference]: Start difference. First operand 1683 states and 2518 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-10-10 22:37:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:45,551 INFO L93 Difference]: Finished difference Result 3367 states and 5039 transitions. [2024-10-10 22:37:45,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:45,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 197 [2024-10-10 22:37:45,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:45,556 INFO L225 Difference]: With dead ends: 3367 [2024-10-10 22:37:45,556 INFO L226 Difference]: Without dead ends: 1685 [2024-10-10 22:37:45,558 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-10-10 22:37:45,559 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 236 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:45,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 410 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:45,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2024-10-10 22:37:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1683. [2024-10-10 22:37:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.316884661117717) internal successors, (2215), 1682 states have internal predecessors, (2215), 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-10-10 22:37:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2215 transitions. [2024-10-10 22:37:45,583 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2215 transitions. Word has length 197 [2024-10-10 22:37:45,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:45,584 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2215 transitions. [2024-10-10 22:37:45,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-10-10 22:37:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2215 transitions. [2024-10-10 22:37:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-10 22:37:45,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:45,587 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:45,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:37:45,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:45,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:45,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1425209977, now seen corresponding path program 1 times [2024-10-10 22:37:45,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:45,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14701901] [2024-10-10 22:37:45,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:45,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:45,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:45,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14701901] [2024-10-10 22:37:45,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14701901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:45,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:45,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:45,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908775139] [2024-10-10 22:37:45,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:45,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:45,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:45,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:45,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:45,843 INFO L87 Difference]: Start difference. First operand 1683 states and 2215 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-10-10 22:37:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:46,501 INFO L93 Difference]: Finished difference Result 4186 states and 5498 transitions. [2024-10-10 22:37:46,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:46,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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 205 [2024-10-10 22:37:46,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:46,509 INFO L225 Difference]: With dead ends: 4186 [2024-10-10 22:37:46,509 INFO L226 Difference]: Without dead ends: 2504 [2024-10-10 22:37:46,511 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-10-10 22:37:46,511 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 210 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:46,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 421 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2024-10-10 22:37:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2496. [2024-10-10 22:37:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.2705410821643286) internal successors, (3170), 2495 states have internal predecessors, (3170), 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-10-10 22:37:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3170 transitions. [2024-10-10 22:37:46,546 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3170 transitions. Word has length 205 [2024-10-10 22:37:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:46,547 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 3170 transitions. [2024-10-10 22:37:46,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-10-10 22:37:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3170 transitions. [2024-10-10 22:37:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-10 22:37:46,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:46,551 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:46,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:37:46,552 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:46,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash 166426196, now seen corresponding path program 1 times [2024-10-10 22:37:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:46,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113185901] [2024-10-10 22:37:46,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:46,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-10 22:37:46,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:46,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113185901] [2024-10-10 22:37:46,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113185901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:46,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:46,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:46,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142901976] [2024-10-10 22:37:46,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:46,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:46,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:46,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:46,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:46,781 INFO L87 Difference]: Start difference. First operand 2496 states and 3170 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 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-10-10 22:37:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:47,492 INFO L93 Difference]: Finished difference Result 7453 states and 9470 transitions. [2024-10-10 22:37:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:47,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 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 205 [2024-10-10 22:37:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:47,507 INFO L225 Difference]: With dead ends: 7453 [2024-10-10 22:37:47,507 INFO L226 Difference]: Without dead ends: 4958 [2024-10-10 22:37:47,510 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-10-10 22:37:47,512 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 259 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:47,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 123 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2024-10-10 22:37:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4949. [2024-10-10 22:37:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4949 states, 4948 states have (on average 1.2621261115602262) internal successors, (6245), 4948 states have internal predecessors, (6245), 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-10-10 22:37:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 6245 transitions. [2024-10-10 22:37:47,582 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 6245 transitions. Word has length 205 [2024-10-10 22:37:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:47,582 INFO L471 AbstractCegarLoop]: Abstraction has 4949 states and 6245 transitions. [2024-10-10 22:37:47,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 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-10-10 22:37:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 6245 transitions. [2024-10-10 22:37:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-10 22:37:47,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:47,590 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:47,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:37:47,590 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:47,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:47,591 INFO L85 PathProgramCache]: Analyzing trace with hash 230486044, now seen corresponding path program 1 times [2024-10-10 22:37:47,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:47,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201841279] [2024-10-10 22:37:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:47,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-10 22:37:48,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:48,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201841279] [2024-10-10 22:37:48,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201841279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:48,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:48,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:48,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36295888] [2024-10-10 22:37:48,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:48,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:48,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:48,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:48,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:48,027 INFO L87 Difference]: Start difference. First operand 4949 states and 6245 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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-10-10 22:37:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:48,731 INFO L93 Difference]: Finished difference Result 13785 states and 17526 transitions. [2024-10-10 22:37:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:48,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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 212 [2024-10-10 22:37:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:48,761 INFO L225 Difference]: With dead ends: 13785 [2024-10-10 22:37:48,761 INFO L226 Difference]: Without dead ends: 8837 [2024-10-10 22:37:48,770 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-10-10 22:37:48,772 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 211 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:48,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 143 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:48,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8837 states. [2024-10-10 22:37:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8837 to 8818. [2024-10-10 22:37:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8818 states, 8817 states have (on average 1.270046501077464) internal successors, (11198), 8817 states have internal predecessors, (11198), 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-10-10 22:37:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8818 states to 8818 states and 11198 transitions. [2024-10-10 22:37:48,944 INFO L78 Accepts]: Start accepts. Automaton has 8818 states and 11198 transitions. Word has length 212 [2024-10-10 22:37:48,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:48,944 INFO L471 AbstractCegarLoop]: Abstraction has 8818 states and 11198 transitions. [2024-10-10 22:37:48,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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-10-10 22:37:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 8818 states and 11198 transitions. [2024-10-10 22:37:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-10 22:37:48,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:48,959 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:48,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:37:48,960 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:48,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:48,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1552832843, now seen corresponding path program 1 times [2024-10-10 22:37:48,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:48,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906446261] [2024-10-10 22:37:48,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:48,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:49,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906446261] [2024-10-10 22:37:49,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906446261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612983236] [2024-10-10 22:37:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:49,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:49,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:49,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:49,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:37:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:49,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:37:49,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:49,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:49,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612983236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:49,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:49,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:49,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421116817] [2024-10-10 22:37:49,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:49,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:49,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:49,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:49,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:49,686 INFO L87 Difference]: Start difference. First operand 8818 states and 11198 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-10-10 22:37:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:50,312 INFO L93 Difference]: Finished difference Result 16815 states and 21327 transitions. [2024-10-10 22:37:50,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:50,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 215 [2024-10-10 22:37:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:50,343 INFO L225 Difference]: With dead ends: 16815 [2024-10-10 22:37:50,343 INFO L226 Difference]: Without dead ends: 8608 [2024-10-10 22:37:50,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:50,356 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 100 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:50,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 379 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:50,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8608 states. [2024-10-10 22:37:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8608 to 8606. [2024-10-10 22:37:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8606 states, 8605 states have (on average 1.220337013364323) internal successors, (10501), 8605 states have internal predecessors, (10501), 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-10-10 22:37:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8606 states to 8606 states and 10501 transitions. [2024-10-10 22:37:50,547 INFO L78 Accepts]: Start accepts. Automaton has 8606 states and 10501 transitions. Word has length 215 [2024-10-10 22:37:50,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:50,548 INFO L471 AbstractCegarLoop]: Abstraction has 8606 states and 10501 transitions. [2024-10-10 22:37:50,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-10-10 22:37:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 8606 states and 10501 transitions. [2024-10-10 22:37:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-10 22:37:50,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:50,558 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:50,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 22:37:50,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:50,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:50,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:50,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1729863084, now seen corresponding path program 1 times [2024-10-10 22:37:50,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:50,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024934975] [2024-10-10 22:37:50,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:50,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:51,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:51,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024934975] [2024-10-10 22:37:51,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024934975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:51,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:51,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:51,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368805007] [2024-10-10 22:37:51,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:51,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:37:51,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:51,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:37:51,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:51,005 INFO L87 Difference]: Start difference. First operand 8606 states and 10501 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 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-10-10 22:37:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:52,096 INFO L93 Difference]: Finished difference Result 17030 states and 20755 transitions. [2024-10-10 22:37:52,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:37:52,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 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 221 [2024-10-10 22:37:52,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:52,115 INFO L225 Difference]: With dead ends: 17030 [2024-10-10 22:37:52,116 INFO L226 Difference]: Without dead ends: 9036 [2024-10-10 22:37:52,124 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-10-10 22:37:52,124 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 440 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:52,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 169 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 22:37:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9036 states. [2024-10-10 22:37:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9036 to 8606. [2024-10-10 22:37:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8606 states, 8605 states have (on average 1.220337013364323) internal successors, (10501), 8605 states have internal predecessors, (10501), 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-10-10 22:37:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8606 states to 8606 states and 10501 transitions. [2024-10-10 22:37:52,224 INFO L78 Accepts]: Start accepts. Automaton has 8606 states and 10501 transitions. Word has length 221 [2024-10-10 22:37:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:52,224 INFO L471 AbstractCegarLoop]: Abstraction has 8606 states and 10501 transitions. [2024-10-10 22:37:52,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 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-10-10 22:37:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 8606 states and 10501 transitions. [2024-10-10 22:37:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-10 22:37:52,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:52,234 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:52,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:37:52,234 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:52,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:52,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1116348187, now seen corresponding path program 1 times [2024-10-10 22:37:52,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:52,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435925197] [2024-10-10 22:37:52,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:52,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:37:52,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:52,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435925197] [2024-10-10 22:37:52,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435925197] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:52,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280453756] [2024-10-10 22:37:52,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:52,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:52,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:52,571 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:52,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:37:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:52,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:52,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 22:37:52,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:52,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280453756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:52,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:52,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:52,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070653322] [2024-10-10 22:37:52,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:52,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:52,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:52,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:52,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:52,923 INFO L87 Difference]: Start difference. First operand 8606 states and 10501 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-10-10 22:37:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:53,645 INFO L93 Difference]: Finished difference Result 21704 states and 26616 transitions. [2024-10-10 22:37:53,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:53,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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 228 [2024-10-10 22:37:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:53,664 INFO L225 Difference]: With dead ends: 21704 [2024-10-10 22:37:53,664 INFO L226 Difference]: Without dead ends: 13507 [2024-10-10 22:37:53,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:53,674 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 66 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:53,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 167 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:53,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13507 states. [2024-10-10 22:37:53,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13507 to 10845. [2024-10-10 22:37:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10845 states, 10844 states have (on average 1.2393950571744743) internal successors, (13440), 10844 states have internal predecessors, (13440), 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-10-10 22:37:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10845 states to 10845 states and 13440 transitions. [2024-10-10 22:37:53,850 INFO L78 Accepts]: Start accepts. Automaton has 10845 states and 13440 transitions. Word has length 228 [2024-10-10 22:37:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:53,851 INFO L471 AbstractCegarLoop]: Abstraction has 10845 states and 13440 transitions. [2024-10-10 22:37:53,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-10-10 22:37:53,851 INFO L276 IsEmpty]: Start isEmpty. Operand 10845 states and 13440 transitions. [2024-10-10 22:37:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-10 22:37:53,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:53,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:53,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:37:54,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:54,063 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:54,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:54,064 INFO L85 PathProgramCache]: Analyzing trace with hash -450776997, now seen corresponding path program 1 times [2024-10-10 22:37:54,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:54,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750219513] [2024-10-10 22:37:54,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:54,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:54,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:54,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750219513] [2024-10-10 22:37:54,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750219513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:54,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:54,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:54,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465612602] [2024-10-10 22:37:54,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:54,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:54,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:54,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:54,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:54,473 INFO L87 Difference]: Start difference. First operand 10845 states and 13440 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 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-10-10 22:37:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:55,095 INFO L93 Difference]: Finished difference Result 24543 states and 30278 transitions. [2024-10-10 22:37:55,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:55,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 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 235 [2024-10-10 22:37:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:55,113 INFO L225 Difference]: With dead ends: 24543 [2024-10-10 22:37:55,113 INFO L226 Difference]: Without dead ends: 13699 [2024-10-10 22:37:55,123 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-10-10 22:37:55,124 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 165 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:55,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 177 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13699 states. [2024-10-10 22:37:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13699 to 13687. [2024-10-10 22:37:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13687 states, 13686 states have (on average 1.216352476983779) internal successors, (16647), 13686 states have internal predecessors, (16647), 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-10-10 22:37:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13687 states to 13687 states and 16647 transitions. [2024-10-10 22:37:55,269 INFO L78 Accepts]: Start accepts. Automaton has 13687 states and 16647 transitions. Word has length 235 [2024-10-10 22:37:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:55,269 INFO L471 AbstractCegarLoop]: Abstraction has 13687 states and 16647 transitions. [2024-10-10 22:37:55,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 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-10-10 22:37:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 13687 states and 16647 transitions. [2024-10-10 22:37:55,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-10 22:37:55,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:55,283 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:55,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:37:55,283 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:55,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:55,284 INFO L85 PathProgramCache]: Analyzing trace with hash 461757740, now seen corresponding path program 1 times [2024-10-10 22:37:55,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:55,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332076591] [2024-10-10 22:37:55,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:55,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:55,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:55,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332076591] [2024-10-10 22:37:55,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332076591] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:55,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509092784] [2024-10-10 22:37:55,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:55,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:55,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:55,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:55,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:37:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:55,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:55,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:55,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:55,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509092784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:55,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:55,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 22:37:55,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589801566] [2024-10-10 22:37:55,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:55,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:55,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:55,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:55,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:55,865 INFO L87 Difference]: Start difference. First operand 13687 states and 16647 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 2 states have internal predecessors, (237), 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-10-10 22:37:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:56,499 INFO L93 Difference]: Finished difference Result 32044 states and 39430 transitions. [2024-10-10 22:37:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:56,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 2 states have internal predecessors, (237), 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 242 [2024-10-10 22:37:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:56,527 INFO L225 Difference]: With dead ends: 32044 [2024-10-10 22:37:56,528 INFO L226 Difference]: Without dead ends: 18561 [2024-10-10 22:37:56,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:56,541 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 187 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:56,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 172 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18561 states. [2024-10-10 22:37:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18561 to 18559. [2024-10-10 22:37:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18559 states, 18558 states have (on average 1.1727017997629055) internal successors, (21763), 18558 states have internal predecessors, (21763), 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-10-10 22:37:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18559 states to 18559 states and 21763 transitions. [2024-10-10 22:37:56,766 INFO L78 Accepts]: Start accepts. Automaton has 18559 states and 21763 transitions. Word has length 242 [2024-10-10 22:37:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:56,766 INFO L471 AbstractCegarLoop]: Abstraction has 18559 states and 21763 transitions. [2024-10-10 22:37:56,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 2 states have internal predecessors, (237), 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-10-10 22:37:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 18559 states and 21763 transitions. [2024-10-10 22:37:56,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-10 22:37:56,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:56,784 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:37:56,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:37:56,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:56,989 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:56,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:56,989 INFO L85 PathProgramCache]: Analyzing trace with hash 429210303, now seen corresponding path program 1 times [2024-10-10 22:37:56,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:56,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100125197] [2024-10-10 22:37:56,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:56,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:57,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:57,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100125197] [2024-10-10 22:37:57,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100125197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:57,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:57,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:57,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490557104] [2024-10-10 22:37:57,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:57,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:57,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:57,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:57,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:57,235 INFO L87 Difference]: Start difference. First operand 18559 states and 21763 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 2 states have internal predecessors, (250), 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-10-10 22:37:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:58,027 INFO L93 Difference]: Finished difference Result 41997 states and 49187 transitions. [2024-10-10 22:37:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:58,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 2 states have internal predecessors, (250), 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 250 [2024-10-10 22:37:58,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:58,060 INFO L225 Difference]: With dead ends: 41997 [2024-10-10 22:37:58,060 INFO L226 Difference]: Without dead ends: 24050 [2024-10-10 22:37:58,073 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-10-10 22:37:58,073 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 171 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:58,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 171 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:58,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24050 states. [2024-10-10 22:37:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24050 to 24049. [2024-10-10 22:37:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24049 states, 24048 states have (on average 1.15040751829674) internal successors, (27665), 24048 states have internal predecessors, (27665), 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-10-10 22:37:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24049 states to 24049 states and 27665 transitions. [2024-10-10 22:37:58,403 INFO L78 Accepts]: Start accepts. Automaton has 24049 states and 27665 transitions. Word has length 250 [2024-10-10 22:37:58,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:58,404 INFO L471 AbstractCegarLoop]: Abstraction has 24049 states and 27665 transitions. [2024-10-10 22:37:58,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 2 states have internal predecessors, (250), 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-10-10 22:37:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 24049 states and 27665 transitions. [2024-10-10 22:37:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-10 22:37:58,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:58,428 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:37:58,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:37:58,429 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:58,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:58,429 INFO L85 PathProgramCache]: Analyzing trace with hash 149533134, now seen corresponding path program 1 times [2024-10-10 22:37:58,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:58,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33141141] [2024-10-10 22:37:58,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:58,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 77 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:59,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:59,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33141141] [2024-10-10 22:37:59,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33141141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:59,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760815372] [2024-10-10 22:37:59,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:59,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:59,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:59,382 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:59,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:37:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:59,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:59,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:59,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:59,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760815372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:59,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:59,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-10 22:37:59,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581174499] [2024-10-10 22:37:59,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:59,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:59,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:59,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:59,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:37:59,588 INFO L87 Difference]: Start difference. First operand 24049 states and 27665 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:00,346 INFO L93 Difference]: Finished difference Result 62128 states and 71543 transitions. [2024-10-10 22:38:00,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:00,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 257 [2024-10-10 22:38:00,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:00,412 INFO L225 Difference]: With dead ends: 62128 [2024-10-10 22:38:00,412 INFO L226 Difference]: Without dead ends: 38691 [2024-10-10 22:38:00,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:38:00,441 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 190 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:00,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 205 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:38:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38691 states. [2024-10-10 22:38:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38691 to 33610. [2024-10-10 22:38:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33610 states, 33609 states have (on average 1.1515367907405754) internal successors, (38702), 33609 states have internal predecessors, (38702), 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-10-10 22:38:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33610 states to 33610 states and 38702 transitions. [2024-10-10 22:38:00,957 INFO L78 Accepts]: Start accepts. Automaton has 33610 states and 38702 transitions. Word has length 257 [2024-10-10 22:38:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:00,957 INFO L471 AbstractCegarLoop]: Abstraction has 33610 states and 38702 transitions. [2024-10-10 22:38:00,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:00,958 INFO L276 IsEmpty]: Start isEmpty. Operand 33610 states and 38702 transitions. [2024-10-10 22:38:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-10-10 22:38:00,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:00,980 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:38:01,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 22:38:01,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 22:38:01,182 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:01,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:01,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1840454327, now seen corresponding path program 1 times [2024-10-10 22:38:01,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:01,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698402989] [2024-10-10 22:38:01,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:01,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:38:01,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:01,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698402989] [2024-10-10 22:38:01,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698402989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:01,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:38:01,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:38:01,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681456087] [2024-10-10 22:38:01,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:01,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:38:01,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:01,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:38:01,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:38:01,455 INFO L87 Difference]: Start difference. First operand 33610 states and 38702 transitions. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 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-10-10 22:38:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:02,403 INFO L93 Difference]: Finished difference Result 76342 states and 87654 transitions. [2024-10-10 22:38:02,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:38:02,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 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 277 [2024-10-10 22:38:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:02,445 INFO L225 Difference]: With dead ends: 76342 [2024-10-10 22:38:02,445 INFO L226 Difference]: Without dead ends: 43343 [2024-10-10 22:38:02,459 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-10-10 22:38:02,460 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 533 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:02,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 49 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:38:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43343 states. [2024-10-10 22:38:02,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43343 to 39680. [2024-10-10 22:38:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39680 states, 39679 states have (on average 1.145921016154641) internal successors, (45469), 39679 states have internal predecessors, (45469), 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-10-10 22:38:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39680 states to 39680 states and 45469 transitions. [2024-10-10 22:38:02,848 INFO L78 Accepts]: Start accepts. Automaton has 39680 states and 45469 transitions. Word has length 277 [2024-10-10 22:38:02,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:02,848 INFO L471 AbstractCegarLoop]: Abstraction has 39680 states and 45469 transitions. [2024-10-10 22:38:02,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 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-10-10 22:38:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 39680 states and 45469 transitions. [2024-10-10 22:38:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-10-10 22:38:02,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:02,863 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:38:02,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 22:38:02,863 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:02,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:02,863 INFO L85 PathProgramCache]: Analyzing trace with hash 717352763, now seen corresponding path program 1 times [2024-10-10 22:38:02,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:02,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303196319] [2024-10-10 22:38:02,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:02,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-10 22:38:03,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303196319] [2024-10-10 22:38:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303196319] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:38:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860530580] [2024-10-10 22:38:03,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:03,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:38:03,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:38:03,253 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:38:03,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:38:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:03,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:38:03,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:38:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-10 22:38:03,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:38:03,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860530580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:03,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:38:03,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:38:03,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306094020] [2024-10-10 22:38:03,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:03,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:03,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:03,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:03,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:38:03,582 INFO L87 Difference]: Start difference. First operand 39680 states and 45469 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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-10-10 22:38:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:04,331 INFO L93 Difference]: Finished difference Result 75281 states and 86227 transitions. [2024-10-10 22:38:04,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:04,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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 288 [2024-10-10 22:38:04,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:04,377 INFO L225 Difference]: With dead ends: 75281 [2024-10-10 22:38:04,377 INFO L226 Difference]: Without dead ends: 36211 [2024-10-10 22:38:04,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:38:04,418 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 81 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:04,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 332 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:38:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36211 states. [2024-10-10 22:38:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36211 to 32555. [2024-10-10 22:38:04,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32555 states, 32554 states have (on average 1.128187012348713) internal successors, (36727), 32554 states have internal predecessors, (36727), 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-10-10 22:38:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32555 states to 32555 states and 36727 transitions. [2024-10-10 22:38:04,937 INFO L78 Accepts]: Start accepts. Automaton has 32555 states and 36727 transitions. Word has length 288 [2024-10-10 22:38:04,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:04,937 INFO L471 AbstractCegarLoop]: Abstraction has 32555 states and 36727 transitions. [2024-10-10 22:38:04,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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-10-10 22:38:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 32555 states and 36727 transitions. [2024-10-10 22:38:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-10-10 22:38:04,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:38:04,956 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:38:04,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 22:38:05,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-10 22:38:05,161 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:38:05,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:38:05,162 INFO L85 PathProgramCache]: Analyzing trace with hash 755827897, now seen corresponding path program 1 times [2024-10-10 22:38:05,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:38:05,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081323395] [2024-10-10 22:38:05,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:05,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:38:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 159 proven. 6 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 22:38:06,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:06,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081323395] [2024-10-10 22:38:06,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081323395] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:38:06,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049953305] [2024-10-10 22:38:06,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:06,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:38:06,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:38:06,314 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:38:06,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 22:38:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:06,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:38:06,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:38:06,653 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-10 22:38:06,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:38:06,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049953305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:06,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:38:06,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:38:06,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19506660] [2024-10-10 22:38:06,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:06,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:38:06,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:06,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:38:06,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:38:06,661 INFO L87 Difference]: Start difference. First operand 32555 states and 36727 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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-10-10 22:38:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:07,325 INFO L93 Difference]: Finished difference Result 74059 states and 83125 transitions. [2024-10-10 22:38:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:38:07,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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 327 [2024-10-10 22:38:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:07,335 INFO L225 Difference]: With dead ends: 74059 [2024-10-10 22:38:07,335 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:38:07,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:38:07,371 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 50 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:07,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 368 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:38:07,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:38:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:38:07,376 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-10-10 22:38:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:38:07,376 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 327 [2024-10-10 22:38:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:38:07,380 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:38:07,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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-10-10 22:38:07,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:38:07,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:38:07,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:38:07,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-10 22:38:07,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 22:38:07,588 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:38:07,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:38:11,720 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:38:11,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:38:11 BoogieIcfgContainer [2024-10-10 22:38:11,750 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:38:11,751 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:38:11,751 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:38:11,751 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:38:11,751 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:37:40" (3/4) ... [2024-10-10 22:38:11,756 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:38:11,788 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 22:38:11,790 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 22:38:11,795 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:38:11,796 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:38:11,982 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:38:11,982 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:38:11,982 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:38:11,983 INFO L158 Benchmark]: Toolchain (without parser) took 33959.01ms. Allocated memory was 197.1MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 120.5MB in the beginning and 989.8MB in the end (delta: -869.3MB). Peak memory consumption was 818.3MB. Max. memory is 16.1GB. [2024-10-10 22:38:11,983 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 197.1MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:38:11,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 814.13ms. Allocated memory is still 197.1MB. Free memory was 120.3MB in the beginning and 120.4MB in the end (delta: -131.5kB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-10 22:38:11,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.44ms. Allocated memory is still 197.1MB. Free memory was 120.4MB in the beginning and 105.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 22:38:11,984 INFO L158 Benchmark]: Boogie Preprocessor took 140.67ms. Allocated memory is still 197.1MB. Free memory was 105.7MB in the beginning and 93.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:38:11,984 INFO L158 Benchmark]: RCFGBuilder took 1757.55ms. Allocated memory was 197.1MB in the beginning and 348.1MB in the end (delta: 151.0MB). Free memory was 93.2MB in the beginning and 169.3MB in the end (delta: -76.1MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. [2024-10-10 22:38:11,984 INFO L158 Benchmark]: TraceAbstraction took 30887.49ms. Allocated memory was 348.1MB in the beginning and 1.9GB in the end (delta: 1.5GB). Free memory was 169.3MB in the beginning and 1.0GB in the end (delta: -846.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-10 22:38:11,987 INFO L158 Benchmark]: Witness Printer took 231.56ms. Allocated memory is still 1.9GB. Free memory was 1.0GB in the beginning and 989.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 22:38:11,988 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 197.1MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 814.13ms. Allocated memory is still 197.1MB. Free memory was 120.3MB in the beginning and 120.4MB in the end (delta: -131.5kB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.44ms. Allocated memory is still 197.1MB. Free memory was 120.4MB in the beginning and 105.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.67ms. Allocated memory is still 197.1MB. Free memory was 105.7MB in the beginning and 93.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1757.55ms. Allocated memory was 197.1MB in the beginning and 348.1MB in the end (delta: 151.0MB). Free memory was 93.2MB in the beginning and 169.3MB in the end (delta: -76.1MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30887.49ms. Allocated memory was 348.1MB in the beginning and 1.9GB in the end (delta: 1.5GB). Free memory was 169.3MB in the beginning and 1.0GB in the end (delta: -846.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 231.56ms. Allocated memory is still 1.9GB. Free memory was 1.0GB in the beginning and 989.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 1579]: 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, 240 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3497 SdHoareTripleChecker+Valid, 11.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3497 mSDsluCounter, 4014 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 414 mSDsCounter, 2049 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10736 IncrementalHoareTripleChecker+Invalid, 12785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2049 mSolverCounterUnsat, 3600 mSDtfsCounter, 10736 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1599 GetRequests, 1566 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39680occurred in iteration=16, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 15569 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 5637 NumberOfCodeBlocks, 5637 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 5613 ConstructedInterpolants, 0 QuantifiedInterpolants, 13931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2893 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 1764/1800 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: 1668]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a5 == 1) && (a12 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a6 <= 0)) || ((((a5 == 1) && (1 <= a3)) && (a6 == 1)) && (a11 <= 0))) || ((((a5 == 1) && (a3 == 1)) && (a11 <= 0)) && (a6 <= 0))) || ((a5 == 1) && (((((a26 <= 0) && (a11 <= 0)) && (a3 == 0)) && (a6 <= 0)) || ((((a11 <= 0) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))))) || (((((a5 == 1) && (1 <= a3)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((a5 == 1) && (1 <= a3)) && (a11 == 1)) && (a6 == 1))) || (((((a5 == 1) && (1 <= a3)) && (a26 <= 0)) && (a11 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0))) || ((((a5 == 1) && (a11 == 1)) && (a3 == 0)) && (a6 <= 0))) || (((((a5 == 1) && (a12 == 1)) && (1 <= a3)) && (a11 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a7 != 1)) && (a6 == 1)) && (a11 <= 0)) && (a3 == 0))) || ((((a5 == 1) && (a11 == 1)) && (a6 == 1)) && (a3 == 0))) || ((((a5 == 1) && (a11 == 1)) && (a3 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (1 <= a3)) && (a26 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (1 <= a3)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a12 == 1)) && (1 <= a3)) && (a11 <= 0)) && (a6 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-10 22:38:12,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE