./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label18.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label18.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e51d75a8ad9c92226cf9c3e34cc8785c0e5af56e84d6fc07c305ea014e608b6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:21:50,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:21:51,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:21:51,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:21:51,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:21:51,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:21:51,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:21:51,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:21:51,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:21:51,043 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:21:51,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:21:51,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:21:51,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:21:51,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:21:51,044 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:21:51,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:21:51,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:21:51,049 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:21:51,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:21:51,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:21:51,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:21:51,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:21:51,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:21:51,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:21:51,055 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:21:51,055 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:21:51,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:21:51,056 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:21:51,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:21:51,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:21:51,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:21:51,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:21:51,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:21:51,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:21:51,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:21:51,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:21:51,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:21:51,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:21:51,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:21:51,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:21:51,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:21:51,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:21:51,059 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e51d75a8ad9c92226cf9c3e34cc8785c0e5af56e84d6fc07c305ea014e608b6 [2024-10-10 23:21:51,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:21:51,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:21:51,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:21:51,373 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:21:51,374 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:21:51,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label18.c [2024-10-10 23:21:52,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:21:53,243 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:21:53,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label18.c [2024-10-10 23:21:53,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ed94e4c3/d8b81c3794c84c33ac01d93844e681ed/FLAGce59b298d [2024-10-10 23:21:53,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ed94e4c3/d8b81c3794c84c33ac01d93844e681ed [2024-10-10 23:21:53,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:21:53,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:21:53,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:21:53,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:21:53,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:21:53,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:21:53" (1/1) ... [2024-10-10 23:21:53,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed41330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:53, skipping insertion in model container [2024-10-10 23:21:53,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:21:53" (1/1) ... [2024-10-10 23:21:53,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:21:53,691 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label18.c[6604,6617] [2024-10-10 23:21:54,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:21:54,380 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:21:54,408 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label18.c[6604,6617] [2024-10-10 23:21:54,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:21:54,844 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:21:54,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:54 WrapperNode [2024-10-10 23:21:54,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:21:54,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:21:54,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:21:54,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:21:54,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:54" (1/1) ... [2024-10-10 23:21:54,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:54" (1/1) ... [2024-10-10 23:21:55,212 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-10 23:21:55,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:21:55,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:21:55,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:21:55,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:21:55,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:54" (1/1) ... [2024-10-10 23:21:55,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:54" (1/1) ... [2024-10-10 23:21:55,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:54" (1/1) ... [2024-10-10 23:21:55,412 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:21:55,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:54" (1/1) ... [2024-10-10 23:21:55,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:54" (1/1) ... [2024-10-10 23:21:55,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:54" (1/1) ... [2024-10-10 23:21:55,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:54" (1/1) ... [2024-10-10 23:21:55,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:54" (1/1) ... [2024-10-10 23:21:55,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:54" (1/1) ... [2024-10-10 23:21:55,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:21:55,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:21:55,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:21:55,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:21:55,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:54" (1/1) ... [2024-10-10 23:21:55,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:21:55,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:21:55,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:21:55,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:21:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:21:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:21:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:21:55,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:21:56,112 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:21:56,114 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:22:00,585 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-10 23:22:00,586 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:22:00,654 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:22:00,654 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:22:00,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:22:00 BoogieIcfgContainer [2024-10-10 23:22:00,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:22:00,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:22:00,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:22:00,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:22:00,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:21:53" (1/3) ... [2024-10-10 23:22:00,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49acd0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:22:00, skipping insertion in model container [2024-10-10 23:22:00,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:54" (2/3) ... [2024-10-10 23:22:00,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49acd0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:22:00, skipping insertion in model container [2024-10-10 23:22:00,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:22:00" (3/3) ... [2024-10-10 23:22:00,664 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label18.c [2024-10-10 23:22:00,678 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:22:00,679 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:22:00,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:22:00,775 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;@25a3d8de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:22:00,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:22:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-10 23:22:00,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:00,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:00,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:00,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:00,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1952340757, now seen corresponding path program 1 times [2024-10-10 23:22:00,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:00,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043174236] [2024-10-10 23:22:00,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:00,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:22:01,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:01,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043174236] [2024-10-10 23:22:01,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043174236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:01,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:01,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:22:01,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958142982] [2024-10-10 23:22:01,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:01,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:22:01,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:01,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:22:01,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:22:01,045 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:01,147 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-10 23:22:01,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:22:01,154 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-10 23:22:01,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:01,182 INFO L225 Difference]: With dead ends: 1511 [2024-10-10 23:22:01,182 INFO L226 Difference]: Without dead ends: 754 [2024-10-10 23:22:01,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:22:01,192 INFO L432 NwaCegarLoop]: 1438 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:01,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:22:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-10 23:22:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-10 23:22:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-10 23:22:01,274 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 52 [2024-10-10 23:22:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:01,275 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-10 23:22:01,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-10 23:22:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-10 23:22:01,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:01,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:01,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:22:01,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:01,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2109272522, now seen corresponding path program 1 times [2024-10-10 23:22:01,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:01,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188693107] [2024-10-10 23:22:01,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:01,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:22:01,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:01,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188693107] [2024-10-10 23:22:01,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188693107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:01,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:01,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:22:01,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929018852] [2024-10-10 23:22:01,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:01,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:01,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:01,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:01,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:01,524 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:04,838 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2024-10-10 23:22:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:04,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-10 23:22:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:04,846 INFO L225 Difference]: With dead ends: 2258 [2024-10-10 23:22:04,846 INFO L226 Difference]: Without dead ends: 1505 [2024-10-10 23:22:04,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:04,848 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 748 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:04,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 473 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:22:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-10 23:22:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2024-10-10 23:22:04,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6070478723404256) internal successors, (2417), 1504 states have internal predecessors, (2417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2417 transitions. [2024-10-10 23:22:04,894 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2417 transitions. Word has length 52 [2024-10-10 23:22:04,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:04,894 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2417 transitions. [2024-10-10 23:22:04,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:04,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2417 transitions. [2024-10-10 23:22:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-10 23:22:04,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:04,898 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:04,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:22:04,899 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:04,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:04,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1842200220, now seen corresponding path program 1 times [2024-10-10 23:22:04,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:04,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088876825] [2024-10-10 23:22:04,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:04,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:22:05,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:05,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088876825] [2024-10-10 23:22:05,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088876825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:05,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:05,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:22:05,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238788574] [2024-10-10 23:22:05,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:05,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:05,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:05,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:05,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:05,099 INFO L87 Difference]: Start difference. First operand 1505 states and 2417 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:08,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:08,322 INFO L93 Difference]: Finished difference Result 4511 states and 7248 transitions. [2024-10-10 23:22:08,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:08,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-10-10 23:22:08,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:08,336 INFO L225 Difference]: With dead ends: 4511 [2024-10-10 23:22:08,336 INFO L226 Difference]: Without dead ends: 3007 [2024-10-10 23:22:08,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:08,340 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 774 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:08,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 447 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:22:08,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-10 23:22:08,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 3007. [2024-10-10 23:22:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.4158349966733201) internal successors, (4256), 3006 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4256 transitions. [2024-10-10 23:22:08,427 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4256 transitions. Word has length 127 [2024-10-10 23:22:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:08,429 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4256 transitions. [2024-10-10 23:22:08,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:08,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4256 transitions. [2024-10-10 23:22:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-10 23:22:08,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:08,436 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:08,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:22:08,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:08,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash -900155959, now seen corresponding path program 1 times [2024-10-10 23:22:08,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:08,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074281122] [2024-10-10 23:22:08,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:08,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:22:08,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:08,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074281122] [2024-10-10 23:22:08,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074281122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:08,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:08,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:08,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365764695] [2024-10-10 23:22:08,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:08,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:22:08,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:08,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:22:08,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:22:08,853 INFO L87 Difference]: Start difference. First operand 3007 states and 4256 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:13,023 INFO L93 Difference]: Finished difference Result 9768 states and 13600 transitions. [2024-10-10 23:22:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:22:13,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2024-10-10 23:22:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:13,048 INFO L225 Difference]: With dead ends: 9768 [2024-10-10 23:22:13,048 INFO L226 Difference]: Without dead ends: 6762 [2024-10-10 23:22:13,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:22:13,056 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 2181 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4713 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 5460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 4713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:13,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2181 Valid, 162 Invalid, 5460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 4713 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-10 23:22:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2024-10-10 23:22:13,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6762. [2024-10-10 23:22:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6762 states, 6761 states have (on average 1.3511314894246413) internal successors, (9135), 6761 states have internal predecessors, (9135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6762 states to 6762 states and 9135 transitions. [2024-10-10 23:22:13,184 INFO L78 Accepts]: Start accepts. Automaton has 6762 states and 9135 transitions. Word has length 129 [2024-10-10 23:22:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:13,185 INFO L471 AbstractCegarLoop]: Abstraction has 6762 states and 9135 transitions. [2024-10-10 23:22:13,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 6762 states and 9135 transitions. [2024-10-10 23:22:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-10 23:22:13,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:13,193 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:13,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:22:13,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:13,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash 936706665, now seen corresponding path program 1 times [2024-10-10 23:22:13,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:13,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844976530] [2024-10-10 23:22:13,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:13,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:22:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:13,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844976530] [2024-10-10 23:22:13,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844976530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:13,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:13,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:13,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207880437] [2024-10-10 23:22:13,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:13,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:13,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:13,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:13,420 INFO L87 Difference]: Start difference. First operand 6762 states and 9135 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:16,036 INFO L93 Difference]: Finished difference Result 15776 states and 21634 transitions. [2024-10-10 23:22:16,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:16,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 193 [2024-10-10 23:22:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:16,064 INFO L225 Difference]: With dead ends: 15776 [2024-10-10 23:22:16,064 INFO L226 Difference]: Without dead ends: 9766 [2024-10-10 23:22:16,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:16,071 INFO L432 NwaCegarLoop]: 1233 mSDtfsCounter, 707 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2694 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 2694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:16,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1240 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 2694 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:22:16,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9766 states. [2024-10-10 23:22:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9766 to 9766. [2024-10-10 23:22:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.3334357398873529) internal successors, (13021), 9765 states have internal predecessors, (13021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 13021 transitions. [2024-10-10 23:22:16,232 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 13021 transitions. Word has length 193 [2024-10-10 23:22:16,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:16,233 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 13021 transitions. [2024-10-10 23:22:16,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 13021 transitions. [2024-10-10 23:22:16,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-10 23:22:16,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:16,236 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:16,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:22:16,237 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:16,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:16,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1284046643, now seen corresponding path program 1 times [2024-10-10 23:22:16,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:16,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788801723] [2024-10-10 23:22:16,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:16,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:22:16,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:16,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788801723] [2024-10-10 23:22:16,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788801723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:16,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:16,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:16,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845820559] [2024-10-10 23:22:16,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:16,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:16,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:16,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:16,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:16,456 INFO L87 Difference]: Start difference. First operand 9766 states and 13021 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:19,245 INFO L93 Difference]: Finished difference Result 18780 states and 25284 transitions. [2024-10-10 23:22:19,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:19,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2024-10-10 23:22:19,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:19,279 INFO L225 Difference]: With dead ends: 18780 [2024-10-10 23:22:19,279 INFO L226 Difference]: Without dead ends: 9766 [2024-10-10 23:22:19,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:19,298 INFO L432 NwaCegarLoop]: 1297 mSDtfsCounter, 737 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 3020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:19,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 1304 Invalid, 3020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:22:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9766 states. [2024-10-10 23:22:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9766 to 9766. [2024-10-10 23:22:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.2982078853046595) internal successors, (12677), 9765 states have internal predecessors, (12677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 12677 transitions. [2024-10-10 23:22:19,457 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 12677 transitions. Word has length 197 [2024-10-10 23:22:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:19,458 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 12677 transitions. [2024-10-10 23:22:19,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 12677 transitions. [2024-10-10 23:22:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-10 23:22:19,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:19,462 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:19,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:22:19,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:19,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:19,463 INFO L85 PathProgramCache]: Analyzing trace with hash 389361192, now seen corresponding path program 1 times [2024-10-10 23:22:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:19,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279843981] [2024-10-10 23:22:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:19,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 23:22:19,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:19,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279843981] [2024-10-10 23:22:19,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279843981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:19,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:19,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:19,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553309078] [2024-10-10 23:22:19,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:19,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:22:19,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:19,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:22:19,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:22:19,819 INFO L87 Difference]: Start difference. First operand 9766 states and 12677 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:22,530 INFO L93 Difference]: Finished difference Result 22572 states and 29090 transitions. [2024-10-10 23:22:22,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:22:22,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 206 [2024-10-10 23:22:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:22,557 INFO L225 Difference]: With dead ends: 22572 [2024-10-10 23:22:22,558 INFO L226 Difference]: Without dead ends: 13521 [2024-10-10 23:22:22,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:22:22,569 INFO L432 NwaCegarLoop]: 608 mSDtfsCounter, 702 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3057 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 3057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:22,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 621 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 3057 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:22:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13521 states. [2024-10-10 23:22:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13521 to 12770. [2024-10-10 23:22:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12770 states, 12769 states have (on average 1.229383663560185) internal successors, (15698), 12769 states have internal predecessors, (15698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12770 states to 12770 states and 15698 transitions. [2024-10-10 23:22:22,806 INFO L78 Accepts]: Start accepts. Automaton has 12770 states and 15698 transitions. Word has length 206 [2024-10-10 23:22:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:22,807 INFO L471 AbstractCegarLoop]: Abstraction has 12770 states and 15698 transitions. [2024-10-10 23:22:22,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 12770 states and 15698 transitions. [2024-10-10 23:22:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-10 23:22:22,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:22,813 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:22,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:22:22,814 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:22,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1813431023, now seen corresponding path program 1 times [2024-10-10 23:22:22,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:22,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540506276] [2024-10-10 23:22:22,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 101 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-10 23:22:23,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540506276] [2024-10-10 23:22:23,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540506276] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:22:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450427547] [2024-10-10 23:22:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:23,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:22:23,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:22:23,259 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:22:23,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:22:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:23,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:22:23,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:22:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:22:23,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:22:23,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450427547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:23,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:22:23,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 23:22:23,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131817517] [2024-10-10 23:22:23,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:23,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:23,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:23,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:23,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:22:23,566 INFO L87 Difference]: Start difference. First operand 12770 states and 15698 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:26,249 INFO L93 Difference]: Finished difference Result 32298 states and 40602 transitions. [2024-10-10 23:22:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:26,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 280 [2024-10-10 23:22:26,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:26,288 INFO L225 Difference]: With dead ends: 32298 [2024-10-10 23:22:26,289 INFO L226 Difference]: Without dead ends: 20280 [2024-10-10 23:22:26,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:22:26,303 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 906 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2073 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:26,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 307 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2073 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:22:26,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20280 states. [2024-10-10 23:22:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20280 to 20280. [2024-10-10 23:22:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20280 states, 20279 states have (on average 1.1926130479806696) internal successors, (24185), 20279 states have internal predecessors, (24185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20280 states to 20280 states and 24185 transitions. [2024-10-10 23:22:26,589 INFO L78 Accepts]: Start accepts. Automaton has 20280 states and 24185 transitions. Word has length 280 [2024-10-10 23:22:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:26,590 INFO L471 AbstractCegarLoop]: Abstraction has 20280 states and 24185 transitions. [2024-10-10 23:22:26,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 20280 states and 24185 transitions. [2024-10-10 23:22:26,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-10 23:22:26,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:26,595 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:26,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:22:26,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:22:26,797 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:26,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:26,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1639096064, now seen corresponding path program 1 times [2024-10-10 23:22:26,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:26,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883117321] [2024-10-10 23:22:26,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:26,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-10 23:22:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:27,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883117321] [2024-10-10 23:22:27,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883117321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:27,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:27,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316708187] [2024-10-10 23:22:27,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:27,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:27,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:27,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:27,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:27,035 INFO L87 Difference]: Start difference. First operand 20280 states and 24185 transitions. Second operand has 3 states, 3 states have (on average 65.0) 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-10-10 23:22:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:29,867 INFO L93 Difference]: Finished difference Result 57081 states and 68619 transitions. [2024-10-10 23:22:29,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:29,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) 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 329 [2024-10-10 23:22:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:29,935 INFO L225 Difference]: With dead ends: 57081 [2024-10-10 23:22:29,935 INFO L226 Difference]: Without dead ends: 37553 [2024-10-10 23:22:29,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:29,961 INFO L432 NwaCegarLoop]: 1335 mSDtfsCounter, 740 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 693 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:29,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 1342 Invalid, 2873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [693 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:22:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37553 states. [2024-10-10 23:22:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37553 to 34549. [2024-10-10 23:22:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34549 states, 34548 states have (on average 1.1545386129443094) internal successors, (39887), 34548 states have internal predecessors, (39887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34549 states to 34549 states and 39887 transitions. [2024-10-10 23:22:30,440 INFO L78 Accepts]: Start accepts. Automaton has 34549 states and 39887 transitions. Word has length 329 [2024-10-10 23:22:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:30,441 INFO L471 AbstractCegarLoop]: Abstraction has 34549 states and 39887 transitions. [2024-10-10 23:22:30,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) 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-10-10 23:22:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 34549 states and 39887 transitions. [2024-10-10 23:22:30,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-10 23:22:30,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:30,448 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-10 23:22:30,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:22:30,448 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:30,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:30,449 INFO L85 PathProgramCache]: Analyzing trace with hash 825857707, now seen corresponding path program 1 times [2024-10-10 23:22:30,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:30,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977795328] [2024-10-10 23:22:30,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:30,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-10 23:22:30,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:30,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977795328] [2024-10-10 23:22:30,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977795328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:30,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:30,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:30,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368518258] [2024-10-10 23:22:30,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:30,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:30,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:30,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:30,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:30,675 INFO L87 Difference]: Start difference. First operand 34549 states and 39887 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:33,312 INFO L93 Difference]: Finished difference Result 80362 states and 93218 transitions. [2024-10-10 23:22:33,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:33,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 351 [2024-10-10 23:22:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:33,388 INFO L225 Difference]: With dead ends: 80362 [2024-10-10 23:22:33,389 INFO L226 Difference]: Without dead ends: 46565 [2024-10-10 23:22:33,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:33,417 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 788 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 767 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 767 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:33,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 254 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [767 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:22:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46565 states. [2024-10-10 23:22:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46565 to 46565. [2024-10-10 23:22:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46565 states, 46564 states have (on average 1.1207585258998367) internal successors, (52187), 46564 states have internal predecessors, (52187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46565 states to 46565 states and 52187 transitions. [2024-10-10 23:22:34,021 INFO L78 Accepts]: Start accepts. Automaton has 46565 states and 52187 transitions. Word has length 351 [2024-10-10 23:22:34,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:34,022 INFO L471 AbstractCegarLoop]: Abstraction has 46565 states and 52187 transitions. [2024-10-10 23:22:34,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 46565 states and 52187 transitions. [2024-10-10 23:22:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-10-10 23:22:34,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:34,030 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:34,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:22:34,031 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:34,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:34,032 INFO L85 PathProgramCache]: Analyzing trace with hash -971530060, now seen corresponding path program 1 times [2024-10-10 23:22:34,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:34,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516992088] [2024-10-10 23:22:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:34,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-10 23:22:34,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:34,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516992088] [2024-10-10 23:22:34,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516992088] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:22:34,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190169873] [2024-10-10 23:22:34,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:34,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:22:34,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:22:34,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:22:34,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:22:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:34,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:22:34,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:22:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-10 23:22:35,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:22:35,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190169873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:35,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:22:35,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:22:35,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272283705] [2024-10-10 23:22:35,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:35,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:35,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:35,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:35,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:22:35,303 INFO L87 Difference]: Start difference. First operand 46565 states and 52187 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:37,879 INFO L93 Difference]: Finished difference Result 113406 states and 127891 transitions. [2024-10-10 23:22:37,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:37,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 357 [2024-10-10 23:22:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:37,980 INFO L225 Difference]: With dead ends: 113406 [2024-10-10 23:22:37,981 INFO L226 Difference]: Without dead ends: 67593 [2024-10-10 23:22:38,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:22:38,027 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 484 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:38,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 505 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:22:38,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67593 states. [2024-10-10 23:22:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67593 to 64589. [2024-10-10 23:22:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64589 states, 64588 states have (on average 1.1085186102681612) internal successors, (71597), 64588 states have internal predecessors, (71597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64589 states to 64589 states and 71597 transitions. [2024-10-10 23:22:38,896 INFO L78 Accepts]: Start accepts. Automaton has 64589 states and 71597 transitions. Word has length 357 [2024-10-10 23:22:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:38,897 INFO L471 AbstractCegarLoop]: Abstraction has 64589 states and 71597 transitions. [2024-10-10 23:22:38,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 64589 states and 71597 transitions. [2024-10-10 23:22:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-10-10 23:22:38,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:38,907 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:38,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:22:39,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:22:39,108 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:39,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:39,109 INFO L85 PathProgramCache]: Analyzing trace with hash 746983025, now seen corresponding path program 1 times [2024-10-10 23:22:39,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:39,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900587015] [2024-10-10 23:22:39,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:39,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:39,633 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-10 23:22:39,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:39,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900587015] [2024-10-10 23:22:39,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900587015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:39,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:39,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:39,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980224790] [2024-10-10 23:22:39,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:39,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:39,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:39,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:39,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:39,636 INFO L87 Difference]: Start difference. First operand 64589 states and 71597 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:42,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:42,844 INFO L93 Difference]: Finished difference Result 156213 states and 174438 transitions. [2024-10-10 23:22:42,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:42,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 382 [2024-10-10 23:22:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:42,968 INFO L225 Difference]: With dead ends: 156213 [2024-10-10 23:22:42,968 INFO L226 Difference]: Without dead ends: 92376 [2024-10-10 23:22:42,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:42,999 INFO L432 NwaCegarLoop]: 594 mSDtfsCounter, 721 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 2961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:42,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 601 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 2428 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:22:43,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92376 states. [2024-10-10 23:22:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92376 to 89372. [2024-10-10 23:22:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89372 states, 89371 states have (on average 1.1061865705877745) internal successors, (98861), 89371 states have internal predecessors, (98861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89372 states to 89372 states and 98861 transitions. [2024-10-10 23:22:44,126 INFO L78 Accepts]: Start accepts. Automaton has 89372 states and 98861 transitions. Word has length 382 [2024-10-10 23:22:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:44,127 INFO L471 AbstractCegarLoop]: Abstraction has 89372 states and 98861 transitions. [2024-10-10 23:22:44,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 89372 states and 98861 transitions. [2024-10-10 23:22:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2024-10-10 23:22:44,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:44,133 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-10 23:22:44,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:22:44,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:44,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:44,134 INFO L85 PathProgramCache]: Analyzing trace with hash 696614491, now seen corresponding path program 1 times [2024-10-10 23:22:44,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:44,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763329290] [2024-10-10 23:22:44,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:44,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 336 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:22:45,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:45,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763329290] [2024-10-10 23:22:45,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763329290] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:22:45,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444033867] [2024-10-10 23:22:45,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:45,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:22:45,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:22:45,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:22:45,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:22:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:45,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:22:45,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:22:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-10 23:22:46,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:22:46,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444033867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:46,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:22:46,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:22:46,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167596763] [2024-10-10 23:22:46,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:46,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:22:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:46,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:22:46,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:22:46,237 INFO L87 Difference]: Start difference. First operand 89372 states and 98861 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:51,281 INFO L93 Difference]: Finished difference Result 247837 states and 275332 transitions. [2024-10-10 23:22:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:22:51,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 383 [2024-10-10 23:22:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:51,530 INFO L225 Difference]: With dead ends: 247837 [2024-10-10 23:22:51,530 INFO L226 Difference]: Without dead ends: 159217 [2024-10-10 23:22:51,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:22:51,558 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1875 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4617 mSolverCounterSat, 565 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 5182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 4617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:51,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 39 Invalid, 5182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 4617 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-10 23:22:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159217 states. [2024-10-10 23:22:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159217 to 159215. [2024-10-10 23:22:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159215 states, 159214 states have (on average 1.1033263406484355) internal successors, (175665), 159214 states have internal predecessors, (175665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159215 states to 159215 states and 175665 transitions. [2024-10-10 23:22:53,978 INFO L78 Accepts]: Start accepts. Automaton has 159215 states and 175665 transitions. Word has length 383 [2024-10-10 23:22:53,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:53,979 INFO L471 AbstractCegarLoop]: Abstraction has 159215 states and 175665 transitions. [2024-10-10 23:22:53,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:53,979 INFO L276 IsEmpty]: Start isEmpty. Operand 159215 states and 175665 transitions. [2024-10-10 23:22:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2024-10-10 23:22:53,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:53,990 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:54,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:22:54,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:22:54,192 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:54,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:54,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1797585194, now seen corresponding path program 1 times [2024-10-10 23:22:54,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:54,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807762722] [2024-10-10 23:22:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:54,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 27 proven. 235 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-10 23:22:54,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:54,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807762722] [2024-10-10 23:22:54,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807762722] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:22:54,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262803014] [2024-10-10 23:22:54,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:54,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:22:54,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:22:54,775 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:22:54,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:22:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:54,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:22:54,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:22:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-10-10 23:22:55,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:22:55,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262803014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:55,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:22:55,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:22:55,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116834227] [2024-10-10 23:22:55,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:55,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:55,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:55,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:55,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:22:55,254 INFO L87 Difference]: Start difference. First operand 159215 states and 175665 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:22:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:58,816 INFO L93 Difference]: Finished difference Result 361236 states and 400498 transitions. [2024-10-10 23:22:58,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:58,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 384 [2024-10-10 23:22:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:59,488 INFO L225 Difference]: With dead ends: 361236 [2024-10-10 23:22:59,488 INFO L226 Difference]: Without dead ends: 202773 [2024-10-10 23:22:59,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:22:59,536 INFO L432 NwaCegarLoop]: 1264 mSDtfsCounter, 692 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:59,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1271 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:22:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202773 states. [2024-10-10 23:23:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202773 to 196765. [2024-10-10 23:23:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196765 states, 196764 states have (on average 1.0944786647964058) internal successors, (215354), 196764 states have internal predecessors, (215354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196765 states to 196765 states and 215354 transitions. [2024-10-10 23:23:02,749 INFO L78 Accepts]: Start accepts. Automaton has 196765 states and 215354 transitions. Word has length 384 [2024-10-10 23:23:02,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:02,750 INFO L471 AbstractCegarLoop]: Abstraction has 196765 states and 215354 transitions. [2024-10-10 23:23:02,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:02,750 INFO L276 IsEmpty]: Start isEmpty. Operand 196765 states and 215354 transitions. [2024-10-10 23:23:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2024-10-10 23:23:02,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:02,766 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:23:02,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 23:23:02,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-10 23:23:02,967 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:02,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash 672521761, now seen corresponding path program 1 times [2024-10-10 23:23:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:02,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925319964] [2024-10-10 23:23:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 649 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-10-10 23:23:03,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:03,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925319964] [2024-10-10 23:23:03,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925319964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:03,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:03,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:03,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28028018] [2024-10-10 23:23:03,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:03,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:03,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:03,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:03,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:03,266 INFO L87 Difference]: Start difference. First operand 196765 states and 215354 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)