./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/Problem10_label52.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label52.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0085780b6a5384f0bbe6d5f11dabc3e1229a09ebe51547a1a74560868441797c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:01:04,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:01:04,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:01:04,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:01:04,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:01:04,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:01:04,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:01:04,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:01:04,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:01:04,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:01:04,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:01:04,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:01:04,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:01:04,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:01:04,970 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:01:04,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:01:04,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:01:04,971 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:01:04,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:01:04,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:01:04,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:01:04,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:01:04,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:01:04,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:01:04,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:01:04,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:01:04,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:01:04,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:01:04,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:01:04,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:01:04,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:01:04,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:01:04,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:01:04,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:01:04,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:01:04,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:01:04,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:01:04,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:01:04,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:01:04,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:01:04,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:01:04,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:01:04,981 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0085780b6a5384f0bbe6d5f11dabc3e1229a09ebe51547a1a74560868441797c [2024-10-23 21:01:05,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:01:05,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:01:05,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:01:05,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:01:05,299 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:01:05,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label52.c [2024-10-23 21:01:06,842 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:01:07,105 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:01:07,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label52.c [2024-10-23 21:01:07,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5ff6f938/6b903cd6ee224c768cc7dc56c764b225/FLAGdd340fcbd [2024-10-23 21:01:07,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5ff6f938/6b903cd6ee224c768cc7dc56c764b225 [2024-10-23 21:01:07,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:01:07,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:01:07,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:01:07,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:01:07,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:01:07,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:01:07" (1/1) ... [2024-10-23 21:01:07,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32394a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07, skipping insertion in model container [2024-10-23 21:01:07,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:01:07" (1/1) ... [2024-10-23 21:01:07,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:01:07,453 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/Problem10_label52.c[4790,4803] [2024-10-23 21:01:07,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:01:07,651 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:01:07,681 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/Problem10_label52.c[4790,4803] [2024-10-23 21:01:07,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:01:07,768 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:01:07,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07 WrapperNode [2024-10-23 21:01:07,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:01:07,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:01:07,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:01:07,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:01:07,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07" (1/1) ... [2024-10-23 21:01:07,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07" (1/1) ... [2024-10-23 21:01:07,866 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-23 21:01:07,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:01:07,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:01:07,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:01:07,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:01:07,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07" (1/1) ... [2024-10-23 21:01:07,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07" (1/1) ... [2024-10-23 21:01:07,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07" (1/1) ... [2024-10-23 21:01:07,933 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-23 21:01:07,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07" (1/1) ... [2024-10-23 21:01:07,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07" (1/1) ... [2024-10-23 21:01:07,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07" (1/1) ... [2024-10-23 21:01:07,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07" (1/1) ... [2024-10-23 21:01:07,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07" (1/1) ... [2024-10-23 21:01:07,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07" (1/1) ... [2024-10-23 21:01:07,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:01:07,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:01:07,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:01:07,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:01:07,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07" (1/1) ... [2024-10-23 21:01:08,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:01:08,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:01:08,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 21:01:08,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 21:01:08,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:01:08,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:01:08,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:01:08,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:01:08,169 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:01:08,171 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:01:09,397 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-23 21:01:09,398 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:01:09,454 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:01:09,454 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:01:09,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:01:09 BoogieIcfgContainer [2024-10-23 21:01:09,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:01:09,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:01:09,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:01:09,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:01:09,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:01:07" (1/3) ... [2024-10-23 21:01:09,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582b683f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:01:09, skipping insertion in model container [2024-10-23 21:01:09,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:01:07" (2/3) ... [2024-10-23 21:01:09,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582b683f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:01:09, skipping insertion in model container [2024-10-23 21:01:09,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:01:09" (3/3) ... [2024-10-23 21:01:09,466 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label52.c [2024-10-23 21:01:09,484 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:01:09,485 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:01:09,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:01:09,567 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;@4f96c5ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:01:09,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:01:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 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-23 21:01:09,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-23 21:01:09,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:09,578 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] [2024-10-23 21:01:09,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:09,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1978643066, now seen corresponding path program 1 times [2024-10-23 21:01:09,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:09,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884282232] [2024-10-23 21:01:09,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:09,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:09,769 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-23 21:01:09,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:09,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884282232] [2024-10-23 21:01:09,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884282232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:09,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:09,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:01:09,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217462137] [2024-10-23 21:01:09,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:09,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:01:09,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:09,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:01:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:01:09,826 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 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 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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-23 21:01:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:09,876 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-23 21:01:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:01:09,882 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-23 21:01:09,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:09,891 INFO L225 Difference]: With dead ends: 287 [2024-10-23 21:01:09,892 INFO L226 Difference]: Without dead ends: 142 [2024-10-23 21:01:09,895 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-23 21:01:09,901 INFO L432 NwaCegarLoop]: 217 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, 217 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-23 21:01:09,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 21:01:09,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-23 21:01:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-23 21:01:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 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-23 21:01:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-23 21:01:09,948 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 40 [2024-10-23 21:01:09,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:09,949 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-23 21:01:09,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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-23 21:01:09,949 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-23 21:01:09,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-23 21:01:09,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:09,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] [2024-10-23 21:01:09,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:01:09,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:09,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash -350910322, now seen corresponding path program 1 times [2024-10-23 21:01:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:09,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027696836] [2024-10-23 21:01:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:09,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:10,146 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-23 21:01:10,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:10,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027696836] [2024-10-23 21:01:10,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027696836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:10,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:10,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:01:10,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482716880] [2024-10-23 21:01:10,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:10,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:10,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:10,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:10,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:10,152 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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-23 21:01:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:10,842 INFO L93 Difference]: Finished difference Result 422 states and 648 transitions. [2024-10-23 21:01:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:10,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-23 21:01:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:10,846 INFO L225 Difference]: With dead ends: 422 [2024-10-23 21:01:10,847 INFO L226 Difference]: Without dead ends: 281 [2024-10-23 21:01:10,848 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-23 21:01:10,849 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 106 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:10,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 65 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:01:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-23 21:01:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-23 21:01:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 280 states have internal predecessors, (376), 0 states have call successors, (0), 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-23 21:01:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 376 transitions. [2024-10-23 21:01:10,876 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 376 transitions. Word has length 40 [2024-10-23 21:01:10,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:10,876 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 376 transitions. [2024-10-23 21:01:10,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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-23 21:01:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 376 transitions. [2024-10-23 21:01:10,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-23 21:01:10,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:10,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:01:10,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:01:10,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:10,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash -771945023, now seen corresponding path program 1 times [2024-10-23 21:01:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:10,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270843567] [2024-10-23 21:01:10,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:01:11,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:11,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270843567] [2024-10-23 21:01:11,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270843567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:11,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:11,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:01:11,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660783722] [2024-10-23 21:01:11,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:11,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:11,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:11,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:11,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:11,148 INFO L87 Difference]: Start difference. First operand 281 states and 376 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:01:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:11,692 INFO L93 Difference]: Finished difference Result 700 states and 966 transitions. [2024-10-23 21:01:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:11,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-10-23 21:01:11,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:11,700 INFO L225 Difference]: With dead ends: 700 [2024-10-23 21:01:11,701 INFO L226 Difference]: Without dead ends: 420 [2024-10-23 21:01:11,702 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-23 21:01:11,703 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 105 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:11,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 212 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:01:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-23 21:01:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-23 21:01:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.2529832935560858) internal successors, (525), 419 states have internal predecessors, (525), 0 states have call successors, (0), 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-23 21:01:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 525 transitions. [2024-10-23 21:01:11,736 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 525 transitions. Word has length 106 [2024-10-23 21:01:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:11,737 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 525 transitions. [2024-10-23 21:01:11,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:01:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 525 transitions. [2024-10-23 21:01:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-23 21:01:11,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:11,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:01:11,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:01:11,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:11,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:11,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1615293722, now seen corresponding path program 1 times [2024-10-23 21:01:11,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:11,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845046867] [2024-10-23 21:01:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:11,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:01:12,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:12,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845046867] [2024-10-23 21:01:12,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845046867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:12,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:12,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:01:12,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847052732] [2024-10-23 21:01:12,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:12,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:12,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:12,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:12,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:12,020 INFO L87 Difference]: Start difference. First operand 420 states and 525 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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-23 21:01:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:12,417 INFO L93 Difference]: Finished difference Result 978 states and 1208 transitions. [2024-10-23 21:01:12,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:12,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-23 21:01:12,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:12,420 INFO L225 Difference]: With dead ends: 978 [2024-10-23 21:01:12,420 INFO L226 Difference]: Without dead ends: 559 [2024-10-23 21:01:12,422 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-23 21:01:12,423 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:12,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 75 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:01:12,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-23 21:01:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-23 21:01:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.2078853046594982) internal successors, (674), 558 states have internal predecessors, (674), 0 states have call successors, (0), 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-23 21:01:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 674 transitions. [2024-10-23 21:01:12,449 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 674 transitions. Word has length 113 [2024-10-23 21:01:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:12,450 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 674 transitions. [2024-10-23 21:01:12,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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-23 21:01:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 674 transitions. [2024-10-23 21:01:12,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-23 21:01:12,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:12,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:01:12,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:01:12,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:12,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1262049333, now seen corresponding path program 1 times [2024-10-23 21:01:12,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:12,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123471098] [2024-10-23 21:01:12,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:01:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:12,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123471098] [2024-10-23 21:01:12,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123471098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:12,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:12,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:01:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949507307] [2024-10-23 21:01:12,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:12,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:12,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:12,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:12,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:12,632 INFO L87 Difference]: Start difference. First operand 559 states and 674 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-23 21:01:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:13,108 INFO L93 Difference]: Finished difference Result 1117 states and 1413 transitions. [2024-10-23 21:01:13,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:13,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-23 21:01:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:13,113 INFO L225 Difference]: With dead ends: 1117 [2024-10-23 21:01:13,113 INFO L226 Difference]: Without dead ends: 698 [2024-10-23 21:01:13,114 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-23 21:01:13,115 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 114 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:13,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 188 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:01:13,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-23 21:01:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-10-23 21:01:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2166427546628407) internal successors, (848), 697 states have internal predecessors, (848), 0 states have call successors, (0), 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-23 21:01:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 848 transitions. [2024-10-23 21:01:13,130 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 848 transitions. Word has length 115 [2024-10-23 21:01:13,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:13,130 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 848 transitions. [2024-10-23 21:01:13,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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-23 21:01:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 848 transitions. [2024-10-23 21:01:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-23 21:01:13,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:13,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:01:13,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 21:01:13,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:13,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:13,134 INFO L85 PathProgramCache]: Analyzing trace with hash 750730995, now seen corresponding path program 1 times [2024-10-23 21:01:13,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:13,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132886606] [2024-10-23 21:01:13,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:13,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:01:13,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:13,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132886606] [2024-10-23 21:01:13,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132886606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:13,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:13,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:01:13,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842129999] [2024-10-23 21:01:13,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:13,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:13,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:13,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:13,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:13,318 INFO L87 Difference]: Start difference. First operand 698 states and 848 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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-23 21:01:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:13,767 INFO L93 Difference]: Finished difference Result 1534 states and 1879 transitions. [2024-10-23 21:01:13,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:13,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2024-10-23 21:01:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:13,771 INFO L225 Difference]: With dead ends: 1534 [2024-10-23 21:01:13,771 INFO L226 Difference]: Without dead ends: 976 [2024-10-23 21:01:13,774 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-23 21:01:13,776 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:13,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 32 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:01:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-23 21:01:13,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-23 21:01:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.1497435897435897) internal successors, (1121), 975 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:01:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1121 transitions. [2024-10-23 21:01:13,804 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1121 transitions. Word has length 131 [2024-10-23 21:01:13,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:13,805 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1121 transitions. [2024-10-23 21:01:13,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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-23 21:01:13,806 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1121 transitions. [2024-10-23 21:01:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-23 21:01:13,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:13,808 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:01:13,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 21:01:13,809 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:13,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:13,809 INFO L85 PathProgramCache]: Analyzing trace with hash 809349193, now seen corresponding path program 1 times [2024-10-23 21:01:13,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:13,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86560774] [2024-10-23 21:01:13,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:13,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:01:14,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:14,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86560774] [2024-10-23 21:01:14,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86560774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:14,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:14,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 21:01:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292100772] [2024-10-23 21:01:14,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:14,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-23 21:01:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-23 21:01:14,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:01:14,255 INFO L87 Difference]: Start difference. First operand 976 states and 1121 transitions. Second operand has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 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-23 21:01:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:14,817 INFO L93 Difference]: Finished difference Result 1867 states and 2152 transitions. [2024-10-23 21:01:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-23 21:01:14,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 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 188 [2024-10-23 21:01:14,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:14,821 INFO L225 Difference]: With dead ends: 1867 [2024-10-23 21:01:14,821 INFO L226 Difference]: Without dead ends: 976 [2024-10-23 21:01:14,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:01:14,823 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:14,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 21 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:01:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-23 21:01:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-23 21:01:14,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.1456410256410257) internal successors, (1117), 975 states have internal predecessors, (1117), 0 states have call successors, (0), 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-23 21:01:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1117 transitions. [2024-10-23 21:01:14,848 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1117 transitions. Word has length 188 [2024-10-23 21:01:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:14,848 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1117 transitions. [2024-10-23 21:01:14,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 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-23 21:01:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1117 transitions. [2024-10-23 21:01:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-23 21:01:14,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:14,851 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:01:14,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 21:01:14,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:14,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:14,853 INFO L85 PathProgramCache]: Analyzing trace with hash -453291665, now seen corresponding path program 1 times [2024-10-23 21:01:14,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:14,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559711984] [2024-10-23 21:01:14,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:14,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-23 21:01:15,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:15,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559711984] [2024-10-23 21:01:15,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559711984] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:01:15,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310166854] [2024-10-23 21:01:15,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:15,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:01:15,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:01:15,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:01:15,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 21:01:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:15,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:01:15,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:01:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-23 21:01:15,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:01:15,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310166854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:15,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:01:15,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-23 21:01:15,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766080661] [2024-10-23 21:01:15,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:15,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:15,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:15,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:15,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:01:15,687 INFO L87 Difference]: Start difference. First operand 976 states and 1117 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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-23 21:01:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:16,166 INFO L93 Difference]: Finished difference Result 1534 states and 1758 transitions. [2024-10-23 21:01:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:16,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 224 [2024-10-23 21:01:16,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:16,172 INFO L225 Difference]: With dead ends: 1534 [2024-10-23 21:01:16,172 INFO L226 Difference]: Without dead ends: 1532 [2024-10-23 21:01:16,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:01:16,173 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:16,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 9 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:01:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-10-23 21:01:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1115. [2024-10-23 21:01:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.1714542190305206) internal successors, (1305), 1114 states have internal predecessors, (1305), 0 states have call successors, (0), 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-23 21:01:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1305 transitions. [2024-10-23 21:01:16,198 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1305 transitions. Word has length 224 [2024-10-23 21:01:16,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:16,198 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1305 transitions. [2024-10-23 21:01:16,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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-23 21:01:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1305 transitions. [2024-10-23 21:01:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-10-23 21:01:16,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:16,203 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:01:16,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 21:01:16,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:01:16,404 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:16,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1986304497, now seen corresponding path program 1 times [2024-10-23 21:01:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:16,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069459756] [2024-10-23 21:01:16,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:16,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-23 21:01:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:16,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069459756] [2024-10-23 21:01:16,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069459756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:16,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:16,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:01:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301687721] [2024-10-23 21:01:16,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:16,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:16,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:16,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:16,669 INFO L87 Difference]: Start difference. First operand 1115 states and 1305 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:01:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:17,156 INFO L93 Difference]: Finished difference Result 2368 states and 2843 transitions. [2024-10-23 21:01:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:17,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 288 [2024-10-23 21:01:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:17,162 INFO L225 Difference]: With dead ends: 2368 [2024-10-23 21:01:17,163 INFO L226 Difference]: Without dead ends: 1393 [2024-10-23 21:01:17,165 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-23 21:01:17,166 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 101 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:17,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 222 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:01:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-23 21:01:17,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1254. [2024-10-23 21:01:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1644054269752593) internal successors, (1459), 1253 states have internal predecessors, (1459), 0 states have call successors, (0), 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-23 21:01:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1459 transitions. [2024-10-23 21:01:17,191 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1459 transitions. Word has length 288 [2024-10-23 21:01:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:17,192 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1459 transitions. [2024-10-23 21:01:17,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:01:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1459 transitions. [2024-10-23 21:01:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-10-23 21:01:17,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:01:17,197 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:01:17,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 21:01:17,197 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:01:17,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:01:17,198 INFO L85 PathProgramCache]: Analyzing trace with hash 852143918, now seen corresponding path program 1 times [2024-10-23 21:01:17,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:01:17,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064116916] [2024-10-23 21:01:17,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:01:17,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:01:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:01:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-10-23 21:01:17,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:01:17,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064116916] [2024-10-23 21:01:17,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064116916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:01:17,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:01:17,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:01:17,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093997618] [2024-10-23 21:01:17,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:01:17,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:01:17,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:01:17,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:01:17,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:01:17,482 INFO L87 Difference]: Start difference. First operand 1254 states and 1459 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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-23 21:01:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:01:17,953 INFO L93 Difference]: Finished difference Result 2644 states and 3075 transitions. [2024-10-23 21:01:17,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:01:17,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 339 [2024-10-23 21:01:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:01:17,956 INFO L225 Difference]: With dead ends: 2644 [2024-10-23 21:01:17,956 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 21:01:17,959 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-23 21:01:17,960 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 101 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:01:17,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 219 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:01:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 21:01:17,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 21:01:17,962 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-23 21:01:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 21:01:17,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 339 [2024-10-23 21:01:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:01:17,962 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 21:01:17,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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-23 21:01:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 21:01:17,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 21:01:17,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 21:01:17,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 21:01:17,970 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:01:17,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 21:01:18,119 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 21:01:18,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:01:18 BoogieIcfgContainer [2024-10-23 21:01:18,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 21:01:18,140 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 21:01:18,140 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 21:01:18,140 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 21:01:18,141 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:01:09" (3/4) ... [2024-10-23 21:01:18,142 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 21:01:18,162 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-23 21:01:18,163 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 21:01:18,164 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 21:01:18,165 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 21:01:18,326 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 21:01:18,327 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 21:01:18,327 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 21:01:18,328 INFO L158 Benchmark]: Toolchain (without parser) took 11178.14ms. Allocated memory was 138.4MB in the beginning and 299.9MB in the end (delta: 161.5MB). Free memory was 65.1MB in the beginning and 166.2MB in the end (delta: -101.1MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2024-10-23 21:01:18,328 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 21:01:18,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.87ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 64.8MB in the beginning and 143.0MB in the end (delta: -78.2MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-10-23 21:01:18,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.29ms. Allocated memory is still 186.6MB. Free memory was 143.0MB in the beginning and 135.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-23 21:01:18,329 INFO L158 Benchmark]: Boogie Preprocessor took 122.02ms. Allocated memory is still 186.6MB. Free memory was 134.6MB in the beginning and 125.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-23 21:01:18,329 INFO L158 Benchmark]: RCFGBuilder took 1460.69ms. Allocated memory is still 186.6MB. Free memory was 125.2MB in the beginning and 123.5MB in the end (delta: 1.7MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2024-10-23 21:01:18,329 INFO L158 Benchmark]: TraceAbstraction took 8681.55ms. Allocated memory was 186.6MB in the beginning and 299.9MB in the end (delta: 113.2MB). Free memory was 123.5MB in the beginning and 177.7MB in the end (delta: -54.2MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2024-10-23 21:01:18,329 INFO L158 Benchmark]: Witness Printer took 187.13ms. Allocated memory is still 299.9MB. Free memory was 177.7MB in the beginning and 166.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-23 21:01:18,331 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 138.4MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 617.87ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 64.8MB in the beginning and 143.0MB in the end (delta: -78.2MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.29ms. Allocated memory is still 186.6MB. Free memory was 143.0MB in the beginning and 135.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 122.02ms. Allocated memory is still 186.6MB. Free memory was 134.6MB in the beginning and 125.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1460.69ms. Allocated memory is still 186.6MB. Free memory was 125.2MB in the beginning and 123.5MB in the end (delta: 1.7MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8681.55ms. Allocated memory was 186.6MB in the beginning and 299.9MB in the end (delta: 113.2MB). Free memory was 123.5MB in the beginning and 177.7MB in the end (delta: -54.2MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. * Witness Printer took 187.13ms. Allocated memory is still 299.9MB. Free memory was 177.7MB in the beginning and 166.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: 137]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 892 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 892 mSDsluCounter, 1260 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 448 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3575 IncrementalHoareTripleChecker+Invalid, 4023 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 448 mSolverCounterUnsat, 1216 mSDtfsCounter, 3575 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1254occurred in iteration=9, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 556 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1808 NumberOfCodeBlocks, 1808 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1797 ConstructedInterpolants, 0 QuantifiedInterpolants, 5355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 324 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1073/1157 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: (((((((((a19 <= 9) && (a10 == 4)) && (14 == a4)) && (a12 == 0)) || (((a10 == 0) && (14 == a4)) && (a12 == 0))) || (((a19 == 9) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((14 == a4) && (a12 == 0)) && (a19 == 6))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-23 21:01:18,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE