./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label57.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 6b5f9be82810a895126d332df54c5a2750e68d4ab931247c71898627df874adb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:30:05,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:30:05,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:30:05,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:30:05,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:30:05,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:30:05,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:30:05,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:30:05,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:30:05,880 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:30:05,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:30:05,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:30:05,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:30:05,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:30:05,884 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:30:05,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:30:05,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:30:05,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:30:05,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:30:05,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:30:05,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:30:05,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:30:05,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:30:05,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:30:05,887 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:30:05,887 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:30:05,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:30:05,888 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:30:05,888 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:30:05,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:30:05,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:30:05,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:30:05,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:30:05,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:30:05,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:30:05,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:30:05,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:30:05,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:30:05,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:30:05,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:30:05,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:30:05,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:30:05,895 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 -> 6b5f9be82810a895126d332df54c5a2750e68d4ab931247c71898627df874adb [2024-11-09 19:30:06,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:30:06,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:30:06,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:30:06,176 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:30:06,177 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:30:06,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label57.c [2024-11-09 19:30:07,766 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:30:08,173 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:30:08,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label57.c [2024-11-09 19:30:08,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b993b950f/c6562c1e6eb7406f99ea9ee1d7d9ed40/FLAG9edb542be [2024-11-09 19:30:08,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b993b950f/c6562c1e6eb7406f99ea9ee1d7d9ed40 [2024-11-09 19:30:08,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:30:08,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:30:08,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:30:08,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:30:08,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:30:08,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:30:08" (1/1) ... [2024-11-09 19:30:08,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6096677e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:08, skipping insertion in model container [2024-11-09 19:30:08,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:30:08" (1/1) ... [2024-11-09 19:30:08,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:30:08,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label57.c[4795,4808] [2024-11-09 19:30:09,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:30:09,562 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:30:09,586 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label57.c[4795,4808] [2024-11-09 19:30:09,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:30:10,007 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:30:10,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:10 WrapperNode [2024-11-09 19:30:10,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:30:10,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:30:10,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:30:10,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:30:10,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:10" (1/1) ... [2024-11-09 19:30:10,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:10" (1/1) ... [2024-11-09 19:30:10,369 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4760 [2024-11-09 19:30:10,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:30:10,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:30:10,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:30:10,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:30:10,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:10" (1/1) ... [2024-11-09 19:30:10,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:10" (1/1) ... [2024-11-09 19:30:10,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:10" (1/1) ... [2024-11-09 19:30:10,605 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:30:10,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:10" (1/1) ... [2024-11-09 19:30:10,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:10" (1/1) ... [2024-11-09 19:30:10,781 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:10" (1/1) ... [2024-11-09 19:30:10,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:10" (1/1) ... [2024-11-09 19:30:10,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:10" (1/1) ... [2024-11-09 19:30:10,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:10" (1/1) ... [2024-11-09 19:30:10,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:30:10,944 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:30:10,944 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:30:10,944 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:30:10,945 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:10" (1/1) ... [2024-11-09 19:30:10,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:30:10,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:30:10,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:30:10,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:30:11,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:30:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:30:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:30:11,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:30:11,109 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:30:11,112 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:30:16,752 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:30:16,753 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2024-11-09 19:30:16,753 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:30:17,033 INFO L? ?]: Removed 2039 outVars from TransFormulas that were not future-live. [2024-11-09 19:30:17,034 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:30:17,087 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:30:17,087 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:30:17,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:30:17 BoogieIcfgContainer [2024-11-09 19:30:17,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:30:17,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:30:17,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:30:17,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:30:17,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:30:08" (1/3) ... [2024-11-09 19:30:17,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f283acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:30:17, skipping insertion in model container [2024-11-09 19:30:17,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:10" (2/3) ... [2024-11-09 19:30:17,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f283acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:30:17, skipping insertion in model container [2024-11-09 19:30:17,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:30:17" (3/3) ... [2024-11-09 19:30:17,099 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label57.c [2024-11-09 19:30:17,116 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:30:17,117 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:30:17,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:30:17,232 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;@54e17970, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:30:17,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:30:17,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 19:30:17,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:17,293 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] [2024-11-09 19:30:17,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:17,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:17,304 INFO L85 PathProgramCache]: Analyzing trace with hash 101400589, now seen corresponding path program 1 times [2024-11-09 19:30:17,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:17,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495376078] [2024-11-09 19:30:17,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:17,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:17,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:17,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495376078] [2024-11-09 19:30:17,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495376078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:17,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:17,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:30:17,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073246014] [2024-11-09 19:30:17,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:17,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:17,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:17,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:17,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:17,753 INFO L87 Difference]: Start difference. First operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:23,025 INFO L93 Difference]: Finished difference Result 2410 states and 6691 transitions. [2024-11-09 19:30:23,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:23,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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 39 [2024-11-09 19:30:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:23,064 INFO L225 Difference]: With dead ends: 2410 [2024-11-09 19:30:23,064 INFO L226 Difference]: Without dead ends: 1509 [2024-11-09 19:30:23,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:23,079 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 1463 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 4393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:23,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1463 Valid, 529 Invalid, 4393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-09 19:30:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2024-11-09 19:30:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2024-11-09 19:30:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 2.5072944297082227) internal successors, (3781), 1508 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 3781 transitions. [2024-11-09 19:30:23,227 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 3781 transitions. Word has length 39 [2024-11-09 19:30:23,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:23,228 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 3781 transitions. [2024-11-09 19:30:23,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 3781 transitions. [2024-11-09 19:30:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 19:30:23,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:23,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:23,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:30:23,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:23,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash 188154302, now seen corresponding path program 1 times [2024-11-09 19:30:23,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:23,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041008179] [2024-11-09 19:30:23,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:23,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:23,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:23,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041008179] [2024-11-09 19:30:23,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041008179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:23,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:23,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:30:23,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164065071] [2024-11-09 19:30:23,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:23,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:30:23,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:23,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:30:23,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:30:23,848 INFO L87 Difference]: Start difference. First operand 1509 states and 3781 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 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-11-09 19:30:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:28,792 INFO L93 Difference]: Finished difference Result 3768 states and 9220 transitions. [2024-11-09 19:30:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:30:28,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 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-11-09 19:30:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:28,803 INFO L225 Difference]: With dead ends: 3768 [2024-11-09 19:30:28,803 INFO L226 Difference]: Without dead ends: 2261 [2024-11-09 19:30:28,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:30:28,806 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 2938 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 5192 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2938 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 5192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:28,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2938 Valid, 1175 Invalid, 5413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 5192 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-09 19:30:28,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2024-11-09 19:30:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2024-11-09 19:30:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2260 states have (on average 2.3092920353982302) internal successors, (5219), 2260 states have internal predecessors, (5219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 5219 transitions. [2024-11-09 19:30:28,853 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 5219 transitions. Word has length 115 [2024-11-09 19:30:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:28,855 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 5219 transitions. [2024-11-09 19:30:28,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 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-11-09 19:30:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 5219 transitions. [2024-11-09 19:30:28,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-09 19:30:28,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:28,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:28,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:30:28,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:28,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:28,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1038487876, now seen corresponding path program 1 times [2024-11-09 19:30:28,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:28,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367780966] [2024-11-09 19:30:28,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:29,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:29,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367780966] [2024-11-09 19:30:29,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367780966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:29,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:29,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:29,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097281488] [2024-11-09 19:30:29,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:29,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:29,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:29,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:29,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:29,129 INFO L87 Difference]: Start difference. First operand 2261 states and 5219 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:32,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:32,934 INFO L93 Difference]: Finished difference Result 5272 states and 12775 transitions. [2024-11-09 19:30:32,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:32,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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 181 [2024-11-09 19:30:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:32,955 INFO L225 Difference]: With dead ends: 5272 [2024-11-09 19:30:32,958 INFO L226 Difference]: Without dead ends: 3765 [2024-11-09 19:30:32,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:32,963 INFO L432 NwaCegarLoop]: 1828 mSDtfsCounter, 1406 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3987 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 4425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 3987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:32,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1406 Valid, 1838 Invalid, 4425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 3987 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 19:30:32,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2024-11-09 19:30:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3765. [2024-11-09 19:30:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3765 states, 3764 states have (on average 2.3196068012752393) internal successors, (8731), 3764 states have internal predecessors, (8731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 8731 transitions. [2024-11-09 19:30:33,041 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 8731 transitions. Word has length 181 [2024-11-09 19:30:33,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:33,042 INFO L471 AbstractCegarLoop]: Abstraction has 3765 states and 8731 transitions. [2024-11-09 19:30:33,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 8731 transitions. [2024-11-09 19:30:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-09 19:30:33,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:33,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:33,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:30:33,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:33,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash 242874064, now seen corresponding path program 1 times [2024-11-09 19:30:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:33,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177290202] [2024-11-09 19:30:33,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:33,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177290202] [2024-11-09 19:30:33,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177290202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:33,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:33,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:33,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243927808] [2024-11-09 19:30:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:33,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:33,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:33,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:33,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:33,278 INFO L87 Difference]: Start difference. First operand 3765 states and 8731 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:37,245 INFO L93 Difference]: Finished difference Result 8280 states and 19799 transitions. [2024-11-09 19:30:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:37,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2024-11-09 19:30:37,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:37,269 INFO L225 Difference]: With dead ends: 8280 [2024-11-09 19:30:37,269 INFO L226 Difference]: Without dead ends: 5269 [2024-11-09 19:30:37,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:37,276 INFO L432 NwaCegarLoop]: 1845 mSDtfsCounter, 1433 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3777 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1433 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 4429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 3777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:37,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1433 Valid, 1855 Invalid, 4429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 3777 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 19:30:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5269 states. [2024-11-09 19:30:37,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5269 to 5269. [2024-11-09 19:30:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5269 states, 5268 states have (on average 2.3263097949886107) internal successors, (12255), 5268 states have internal predecessors, (12255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5269 states to 5269 states and 12255 transitions. [2024-11-09 19:30:37,388 INFO L78 Accepts]: Start accepts. Automaton has 5269 states and 12255 transitions. Word has length 185 [2024-11-09 19:30:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:37,389 INFO L471 AbstractCegarLoop]: Abstraction has 5269 states and 12255 transitions. [2024-11-09 19:30:37,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5269 states and 12255 transitions. [2024-11-09 19:30:37,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-09 19:30:37,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:37,395 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:30:37,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:30:37,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:37,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1846897787, now seen corresponding path program 1 times [2024-11-09 19:30:37,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:37,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153794125] [2024-11-09 19:30:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:37,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 19:30:37,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:37,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153794125] [2024-11-09 19:30:37,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153794125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:37,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:37,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:37,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281144709] [2024-11-09 19:30:37,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:37,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:30:37,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:37,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:30:37,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:30:37,728 INFO L87 Difference]: Start difference. First operand 5269 states and 12255 transitions. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:41,939 INFO L93 Difference]: Finished difference Result 12078 states and 27992 transitions. [2024-11-09 19:30:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:30:41,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 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 195 [2024-11-09 19:30:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:41,965 INFO L225 Difference]: With dead ends: 12078 [2024-11-09 19:30:41,965 INFO L226 Difference]: Without dead ends: 7525 [2024-11-09 19:30:41,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:30:41,973 INFO L432 NwaCegarLoop]: 691 mSDtfsCounter, 1368 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5837 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 6044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 5837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:41,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 713 Invalid, 6044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 5837 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:30:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7525 states. [2024-11-09 19:30:42,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7525 to 7525. [2024-11-09 19:30:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7525 states, 7524 states have (on average 2.2107921318447636) internal successors, (16634), 7524 states have internal predecessors, (16634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7525 states to 7525 states and 16634 transitions. [2024-11-09 19:30:42,120 INFO L78 Accepts]: Start accepts. Automaton has 7525 states and 16634 transitions. Word has length 195 [2024-11-09 19:30:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:42,121 INFO L471 AbstractCegarLoop]: Abstraction has 7525 states and 16634 transitions. [2024-11-09 19:30:42,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 7525 states and 16634 transitions. [2024-11-09 19:30:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-09 19:30:42,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:42,124 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:42,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:30:42,125 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:42,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:42,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1427087005, now seen corresponding path program 1 times [2024-11-09 19:30:42,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:42,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580478771] [2024-11-09 19:30:42,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:42,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 19:30:42,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:42,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580478771] [2024-11-09 19:30:42,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580478771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:30:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709335676] [2024-11-09 19:30:42,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:42,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:30:42,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:30:42,568 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:30:42,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:30:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:42,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:30:42,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:30:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 19:30:43,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:30:43,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709335676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:43,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:30:43,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-09 19:30:43,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738753859] [2024-11-09 19:30:43,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:43,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:43,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:43,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:43,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:30:43,043 INFO L87 Difference]: Start difference. First operand 7525 states and 16634 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:46,562 INFO L93 Difference]: Finished difference Result 20312 states and 45528 transitions. [2024-11-09 19:30:46,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:46,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 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 251 [2024-11-09 19:30:46,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:46,595 INFO L225 Difference]: With dead ends: 20312 [2024-11-09 19:30:46,595 INFO L226 Difference]: Without dead ends: 13541 [2024-11-09 19:30:46,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 250 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-11-09 19:30:46,605 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 1360 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3340 mSolverCounterSat, 856 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 4196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 856 IncrementalHoareTripleChecker+Valid, 3340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:46,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 459 Invalid, 4196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [856 Valid, 3340 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 19:30:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13541 states. [2024-11-09 19:30:46,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13541 to 12789. [2024-11-09 19:30:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12789 states, 12788 states have (on average 2.1434939005317486) internal successors, (27411), 12788 states have internal predecessors, (27411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12789 states to 12789 states and 27411 transitions. [2024-11-09 19:30:46,859 INFO L78 Accepts]: Start accepts. Automaton has 12789 states and 27411 transitions. Word has length 251 [2024-11-09 19:30:46,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:46,860 INFO L471 AbstractCegarLoop]: Abstraction has 12789 states and 27411 transitions. [2024-11-09 19:30:46,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 12789 states and 27411 transitions. [2024-11-09 19:30:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-09 19:30:46,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:46,864 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:46,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:30:47,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 19:30:47,066 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:47,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:47,067 INFO L85 PathProgramCache]: Analyzing trace with hash 22408217, now seen corresponding path program 1 times [2024-11-09 19:30:47,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:47,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401387487] [2024-11-09 19:30:47,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:47,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-09 19:30:47,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:47,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401387487] [2024-11-09 19:30:47,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401387487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:47,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:47,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:30:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045648156] [2024-11-09 19:30:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:47,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:47,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:47,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:47,264 INFO L87 Difference]: Start difference. First operand 12789 states and 27411 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:51,161 INFO L93 Difference]: Finished difference Result 33099 states and 71898 transitions. [2024-11-09 19:30:51,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:51,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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 269 [2024-11-09 19:30:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:51,212 INFO L225 Difference]: With dead ends: 33099 [2024-11-09 19:30:51,212 INFO L226 Difference]: Without dead ends: 21064 [2024-11-09 19:30:51,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:51,227 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1525 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 4135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:51,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 314 Invalid, 4135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 19:30:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21064 states. [2024-11-09 19:30:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21064 to 21061. [2024-11-09 19:30:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21061 states, 21060 states have (on average 2.108309591642925) internal successors, (44401), 21060 states have internal predecessors, (44401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21061 states to 21061 states and 44401 transitions. [2024-11-09 19:30:51,598 INFO L78 Accepts]: Start accepts. Automaton has 21061 states and 44401 transitions. Word has length 269 [2024-11-09 19:30:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:51,598 INFO L471 AbstractCegarLoop]: Abstraction has 21061 states and 44401 transitions. [2024-11-09 19:30:51,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 21061 states and 44401 transitions. [2024-11-09 19:30:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-11-09 19:30:51,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:51,604 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:51,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:30:51,605 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:51,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:51,606 INFO L85 PathProgramCache]: Analyzing trace with hash -830995591, now seen corresponding path program 1 times [2024-11-09 19:30:51,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:51,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000953569] [2024-11-09 19:30:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:51,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 19:30:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:51,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000953569] [2024-11-09 19:30:51,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000953569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:51,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:51,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385455643] [2024-11-09 19:30:51,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:51,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:51,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:51,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:51,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:51,825 INFO L87 Difference]: Start difference. First operand 21061 states and 44401 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:55,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:55,297 INFO L93 Difference]: Finished difference Result 41368 states and 87363 transitions. [2024-11-09 19:30:55,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:55,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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 318 [2024-11-09 19:30:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:55,339 INFO L225 Difference]: With dead ends: 41368 [2024-11-09 19:30:55,340 INFO L226 Difference]: Without dead ends: 21061 [2024-11-09 19:30:55,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:55,362 INFO L432 NwaCegarLoop]: 1674 mSDtfsCounter, 1470 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3673 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 4069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 3673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:55,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1684 Invalid, 4069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 3673 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 19:30:55,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21061 states. [2024-11-09 19:30:55,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21061 to 21061. [2024-11-09 19:30:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21061 states, 21060 states have (on average 2.0718423551756886) internal successors, (43633), 21060 states have internal predecessors, (43633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21061 states to 21061 states and 43633 transitions. [2024-11-09 19:30:55,679 INFO L78 Accepts]: Start accepts. Automaton has 21061 states and 43633 transitions. Word has length 318 [2024-11-09 19:30:55,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:55,679 INFO L471 AbstractCegarLoop]: Abstraction has 21061 states and 43633 transitions. [2024-11-09 19:30:55,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 21061 states and 43633 transitions. [2024-11-09 19:30:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-09 19:30:55,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:55,685 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:55,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:30:55,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:55,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:55,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2071910914, now seen corresponding path program 1 times [2024-11-09 19:30:55,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:55,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720253191] [2024-11-09 19:30:55,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:55,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-09 19:30:56,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720253191] [2024-11-09 19:30:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720253191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:56,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:56,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340897760] [2024-11-09 19:30:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:56,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:56,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:56,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:56,080 INFO L87 Difference]: Start difference. First operand 21061 states and 43633 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:59,876 INFO L93 Difference]: Finished difference Result 50392 states and 105421 transitions. [2024-11-09 19:30:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:59,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 341 [2024-11-09 19:30:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:59,921 INFO L225 Difference]: With dead ends: 50392 [2024-11-09 19:30:59,922 INFO L226 Difference]: Without dead ends: 30085 [2024-11-09 19:30:59,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:59,943 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 1392 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3639 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 4325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 3639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:59,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 485 Invalid, 4325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 3639 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:30:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30085 states. [2024-11-09 19:31:00,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30085 to 30085. [2024-11-09 19:31:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30085 states, 30084 states have (on average 2.0704361122191197) internal successors, (62287), 30084 states have internal predecessors, (62287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30085 states to 30085 states and 62287 transitions. [2024-11-09 19:31:00,484 INFO L78 Accepts]: Start accepts. Automaton has 30085 states and 62287 transitions. Word has length 341 [2024-11-09 19:31:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:00,485 INFO L471 AbstractCegarLoop]: Abstraction has 30085 states and 62287 transitions. [2024-11-09 19:31:00,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 30085 states and 62287 transitions. [2024-11-09 19:31:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-11-09 19:31:00,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:00,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:31:00,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:31:00,492 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:00,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:00,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1668750805, now seen corresponding path program 1 times [2024-11-09 19:31:00,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:00,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568468785] [2024-11-09 19:31:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:00,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 19:31:00,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:00,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568468785] [2024-11-09 19:31:00,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568468785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:31:00,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563552471] [2024-11-09 19:31:00,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:00,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:31:00,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:31:00,941 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:31:00,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:31:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:01,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:31:01,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:31:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 19:31:01,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:31:01,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563552471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:01,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:31:01,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-09 19:31:01,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41879239] [2024-11-09 19:31:01,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:01,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:31:01,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:01,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:31:01,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:31:01,463 INFO L87 Difference]: Start difference. First operand 30085 states and 62287 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 2 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:05,491 INFO L93 Difference]: Finished difference Result 87992 states and 182543 transitions. [2024-11-09 19:31:05,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:05,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 2 states have internal predecessors, (311), 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 345 [2024-11-09 19:31:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:05,579 INFO L225 Difference]: With dead ends: 87992 [2024-11-09 19:31:05,579 INFO L226 Difference]: Without dead ends: 58661 [2024-11-09 19:31:05,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 344 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-11-09 19:31:05,610 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 1148 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3692 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 4256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 3692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:05,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 570 Invalid, 4256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 3692 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 19:31:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58661 states. [2024-11-09 19:31:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58661 to 52645. [2024-11-09 19:31:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52645 states, 52644 states have (on average 2.0374211686042094) internal successors, (107258), 52644 states have internal predecessors, (107258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52645 states to 52645 states and 107258 transitions. [2024-11-09 19:31:06,398 INFO L78 Accepts]: Start accepts. Automaton has 52645 states and 107258 transitions. Word has length 345 [2024-11-09 19:31:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:06,399 INFO L471 AbstractCegarLoop]: Abstraction has 52645 states and 107258 transitions. [2024-11-09 19:31:06,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 2 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:06,400 INFO L276 IsEmpty]: Start isEmpty. Operand 52645 states and 107258 transitions. [2024-11-09 19:31:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-09 19:31:06,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:06,405 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:31:06,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 19:31:06,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 19:31:06,606 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:06,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1213972898, now seen corresponding path program 1 times [2024-11-09 19:31:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:06,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986546774] [2024-11-09 19:31:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-09 19:31:07,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:07,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986546774] [2024-11-09 19:31:07,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986546774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:07,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:31:07,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:31:07,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563774496] [2024-11-09 19:31:07,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:07,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:31:07,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:07,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:31:07,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:31:07,459 INFO L87 Difference]: Start difference. First operand 52645 states and 107258 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 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-11-09 19:31:11,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:11,262 INFO L93 Difference]: Finished difference Result 123336 states and 250612 transitions. [2024-11-09 19:31:11,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:11,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 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 373 [2024-11-09 19:31:11,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:11,366 INFO L225 Difference]: With dead ends: 123336 [2024-11-09 19:31:11,366 INFO L226 Difference]: Without dead ends: 71445 [2024-11-09 19:31:11,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:31:11,406 INFO L432 NwaCegarLoop]: 1581 mSDtfsCounter, 1514 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3497 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 4092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 3497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:11,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1591 Invalid, 4092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 3497 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 19:31:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71445 states. [2024-11-09 19:31:12,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71445 to 64677. [2024-11-09 19:31:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64677 states, 64676 states have (on average 2.024042921640176) internal successors, (130907), 64676 states have internal predecessors, (130907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64677 states to 64677 states and 130907 transitions. [2024-11-09 19:31:12,718 INFO L78 Accepts]: Start accepts. Automaton has 64677 states and 130907 transitions. Word has length 373 [2024-11-09 19:31:12,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:12,719 INFO L471 AbstractCegarLoop]: Abstraction has 64677 states and 130907 transitions. [2024-11-09 19:31:12,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 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-11-09 19:31:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 64677 states and 130907 transitions. [2024-11-09 19:31:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2024-11-09 19:31:12,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:12,878 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:31:12,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:31:12,879 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:12,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:12,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1641757042, now seen corresponding path program 1 times [2024-11-09 19:31:12,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:12,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201940184] [2024-11-09 19:31:12,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:12,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 149 proven. 231 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-09 19:31:13,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:13,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201940184] [2024-11-09 19:31:13,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201940184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:31:13,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642692192] [2024-11-09 19:31:13,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:13,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:31:13,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:31:13,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:31:13,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:31:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:13,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:31:13,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:31:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-09 19:31:14,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:31:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642692192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:14,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:31:14,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-09 19:31:14,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614618751] [2024-11-09 19:31:14,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:14,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:31:14,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:14,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:31:14,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:31:14,289 INFO L87 Difference]: Start difference. First operand 64677 states and 130907 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:18,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:18,676 INFO L93 Difference]: Finished difference Result 156424 states and 318235 transitions. [2024-11-09 19:31:18,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:18,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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 560 [2024-11-09 19:31:18,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:18,961 INFO L225 Difference]: With dead ends: 156424 [2024-11-09 19:31:18,961 INFO L226 Difference]: Without dead ends: 92501 [2024-11-09 19:31:18,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 560 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:31:18,985 INFO L432 NwaCegarLoop]: 1611 mSDtfsCounter, 1216 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3646 mSolverCounterSat, 754 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 4400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 3646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:18,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 1619 Invalid, 4400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [754 Valid, 3646 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 19:31:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92501 states. [2024-11-09 19:31:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92501 to 92501. [2024-11-09 19:31:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92501 states, 92500 states have (on average 2.0308) internal successors, (187849), 92500 states have internal predecessors, (187849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92501 states to 92501 states and 187849 transitions. [2024-11-09 19:31:20,649 INFO L78 Accepts]: Start accepts. Automaton has 92501 states and 187849 transitions. Word has length 560 [2024-11-09 19:31:20,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:20,651 INFO L471 AbstractCegarLoop]: Abstraction has 92501 states and 187849 transitions. [2024-11-09 19:31:20,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand 92501 states and 187849 transitions. [2024-11-09 19:31:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2024-11-09 19:31:20,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:20,685 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:31:20,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 19:31:20,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:31:20,886 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:20,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:20,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1892581599, now seen corresponding path program 1 times [2024-11-09 19:31:20,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:20,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754673369] [2024-11-09 19:31:20,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:20,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat