./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/Problem14_label48.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/Problem14_label48.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 8261a53c19f43c038d6c9bf7efdae8a565c27af3d0b11334f16494326c28bf76 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:34:21,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:34:21,439 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:34:21,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:34:21,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:34:21,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:34:21,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:34:21,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:34:21,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:34:21,482 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:34:21,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:34:21,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:34:21,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:34:21,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:34:21,485 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:34:21,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:34:21,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:34:21,488 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:34:21,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:34:21,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:34:21,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:34:21,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:34:21,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:34:21,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:34:21,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:34:21,493 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:34:21,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:34:21,494 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:34:21,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:34:21,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:34:21,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:34:21,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:34:21,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:34:21,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:34:21,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:34:21,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:34:21,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:34:21,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:34:21,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:34:21,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:34:21,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:34:21,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:34:21,509 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 -> 8261a53c19f43c038d6c9bf7efdae8a565c27af3d0b11334f16494326c28bf76 [2024-10-10 23:34:21,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:34:21,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:34:21,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:34:21,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:34:21,809 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:34:21,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label48.c [2024-10-10 23:34:23,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:34:23,539 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:34:23,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label48.c [2024-10-10 23:34:23,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5619a9d44/d2ad818219534defb2cb72e2641178e5/FLAGa0274e268 [2024-10-10 23:34:23,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5619a9d44/d2ad818219534defb2cb72e2641178e5 [2024-10-10 23:34:23,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:34:23,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:34:23,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:34:23,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:34:23,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:34:23,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:34:23" (1/1) ... [2024-10-10 23:34:23,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e867097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:23, skipping insertion in model container [2024-10-10 23:34:23,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:34:23" (1/1) ... [2024-10-10 23:34:23,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:34:24,147 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/Problem14_label48.c[4040,4053] [2024-10-10 23:34:24,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:34:24,331 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:34:24,347 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/Problem14_label48.c[4040,4053] [2024-10-10 23:34:24,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:34:24,499 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:34:24,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:24 WrapperNode [2024-10-10 23:34:24,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:34:24,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:34:24,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:34:24,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:34:24,508 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:34:24" (1/1) ... [2024-10-10 23:34:24,530 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:34:24" (1/1) ... [2024-10-10 23:34:24,599 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-10 23:34:24,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:34:24,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:34:24,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:34:24,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:34:24,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:24" (1/1) ... [2024-10-10 23:34:24,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:24" (1/1) ... [2024-10-10 23:34:24,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:24" (1/1) ... [2024-10-10 23:34:24,663 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:34:24,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:24" (1/1) ... [2024-10-10 23:34:24,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:24" (1/1) ... [2024-10-10 23:34:24,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:24" (1/1) ... [2024-10-10 23:34:24,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:24" (1/1) ... [2024-10-10 23:34:24,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:24" (1/1) ... [2024-10-10 23:34:24,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:24" (1/1) ... [2024-10-10 23:34:24,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:34:24,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:34:24,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:34:24,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:34:24,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:24" (1/1) ... [2024-10-10 23:34:24,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:34:24,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:34:24,772 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:34:24,775 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:34:24,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:34:24,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:34:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:34:24,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:34:24,898 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:34:24,900 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:34:26,149 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-10 23:34:26,149 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:34:26,219 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:34:26,219 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:34:26,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:34:26 BoogieIcfgContainer [2024-10-10 23:34:26,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:34:26,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:34:26,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:34:26,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:34:26,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:34:23" (1/3) ... [2024-10-10 23:34:26,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552af855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:34:26, skipping insertion in model container [2024-10-10 23:34:26,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:24" (2/3) ... [2024-10-10 23:34:26,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552af855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:34:26, skipping insertion in model container [2024-10-10 23:34:26,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:34:26" (3/3) ... [2024-10-10 23:34:26,229 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label48.c [2024-10-10 23:34:26,247 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:34:26,247 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:34:26,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:34:26,321 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;@5881d26e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:34:26,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:34:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 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:34:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-10 23:34:26,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:26,336 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] [2024-10-10 23:34:26,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:26,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash -32276695, now seen corresponding path program 1 times [2024-10-10 23:34:26,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:26,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985120859] [2024-10-10 23:34:26,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:26,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:26,552 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:34:26,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:26,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985120859] [2024-10-10 23:34:26,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985120859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:26,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:26,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:34:26,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044786104] [2024-10-10 23:34:26,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:26,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:34:26,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:26,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:34:26,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:34:26,591 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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:34:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:26,644 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-10 23:34:26,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:34:26,646 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-10-10 23:34:26,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:26,659 INFO L225 Difference]: With dead ends: 365 [2024-10-10 23:34:26,660 INFO L226 Difference]: Without dead ends: 181 [2024-10-10 23:34:26,664 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:34:26,670 INFO L432 NwaCegarLoop]: 295 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, 295 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:34:26,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:34:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-10 23:34:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-10 23:34:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 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:34:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-10 23:34:26,722 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 37 [2024-10-10 23:34:26,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:26,723 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-10 23:34:26,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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:34:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-10 23:34:26,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-10 23:34:26,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:26,725 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] [2024-10-10 23:34:26,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:34:26,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:26,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:26,727 INFO L85 PathProgramCache]: Analyzing trace with hash -447730178, now seen corresponding path program 1 times [2024-10-10 23:34:26,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:26,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516324804] [2024-10-10 23:34:26,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:26,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:26,975 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:34:26,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:26,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516324804] [2024-10-10 23:34:26,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516324804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057907813] [2024-10-10 23:34:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:26,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:34:26,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:26,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:34:26,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:34:26,981 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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:34:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:28,306 INFO L93 Difference]: Finished difference Result 717 states and 1175 transitions. [2024-10-10 23:34:28,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:34:28,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-10-10 23:34:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:28,311 INFO L225 Difference]: With dead ends: 717 [2024-10-10 23:34:28,311 INFO L226 Difference]: Without dead ends: 537 [2024-10-10 23:34:28,312 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:34:28,313 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 503 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:28,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 14 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:34:28,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-10-10 23:34:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2024-10-10 23:34:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4496268656716418) internal successors, (777), 536 states have internal predecessors, (777), 0 states have call successors, (0), 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:34:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 777 transitions. [2024-10-10 23:34:28,355 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 777 transitions. Word has length 37 [2024-10-10 23:34:28,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:28,356 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 777 transitions. [2024-10-10 23:34:28,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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:34:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 777 transitions. [2024-10-10 23:34:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-10 23:34:28,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:28,370 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:34:28,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:34:28,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:28,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:28,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1364568844, now seen corresponding path program 1 times [2024-10-10 23:34:28,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:28,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870447611] [2024-10-10 23:34:28,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:28,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-10 23:34:28,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:28,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870447611] [2024-10-10 23:34:28,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870447611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:28,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:28,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:34:28,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278966009] [2024-10-10 23:34:28,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:28,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:28,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:28,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:28,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:28,630 INFO L87 Difference]: Start difference. First operand 537 states and 777 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:34:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:29,270 INFO L93 Difference]: Finished difference Result 1073 states and 1655 transitions. [2024-10-10 23:34:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:29,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2024-10-10 23:34:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:29,274 INFO L225 Difference]: With dead ends: 1073 [2024-10-10 23:34:29,274 INFO L226 Difference]: Without dead ends: 715 [2024-10-10 23:34:29,275 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:34:29,276 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:29,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 55 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:34:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-10 23:34:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-10 23:34:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.354341736694678) internal successors, (967), 714 states have internal predecessors, (967), 0 states have call successors, (0), 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:34:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 967 transitions. [2024-10-10 23:34:29,300 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 967 transitions. Word has length 185 [2024-10-10 23:34:29,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:29,300 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 967 transitions. [2024-10-10 23:34:29,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:34:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 967 transitions. [2024-10-10 23:34:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-10 23:34:29,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:29,305 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:29,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:34:29,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:29,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:29,306 INFO L85 PathProgramCache]: Analyzing trace with hash 366747327, now seen corresponding path program 1 times [2024-10-10 23:34:29,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:29,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679354095] [2024-10-10 23:34:29,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:29,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-10 23:34:29,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:29,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679354095] [2024-10-10 23:34:29,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679354095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:29,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:29,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:29,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959611900] [2024-10-10 23:34:29,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:29,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:34:29,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:29,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:34:29,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:34:29,693 INFO L87 Difference]: Start difference. First operand 715 states and 967 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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:34:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:30,324 INFO L93 Difference]: Finished difference Result 1636 states and 2267 transitions. [2024-10-10 23:34:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:34:30,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 208 [2024-10-10 23:34:30,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:30,329 INFO L225 Difference]: With dead ends: 1636 [2024-10-10 23:34:30,329 INFO L226 Difference]: Without dead ends: 1071 [2024-10-10 23:34:30,330 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:34:30,331 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 110 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:30,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 110 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:34:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-10 23:34:30,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 893. [2024-10-10 23:34:30,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.1726457399103138) internal successors, (1046), 892 states have internal predecessors, (1046), 0 states have call successors, (0), 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:34:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1046 transitions. [2024-10-10 23:34:30,352 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1046 transitions. Word has length 208 [2024-10-10 23:34:30,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:30,353 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1046 transitions. [2024-10-10 23:34:30,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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:34:30,354 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1046 transitions. [2024-10-10 23:34:30,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-10-10 23:34:30,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:30,359 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:30,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:34:30,360 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:30,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1025184852, now seen corresponding path program 1 times [2024-10-10 23:34:30,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:30,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662857259] [2024-10-10 23:34:30,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:30,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 171 proven. 130 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-10 23:34:31,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:31,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662857259] [2024-10-10 23:34:31,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662857259] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:34:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741306587] [2024-10-10 23:34:31,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:31,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:31,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:34:31,136 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:34:31,137 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:34:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:31,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:34:31,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:34:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-10-10 23:34:31,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:34:31,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741306587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:31,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:34:31,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:34:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079254683] [2024-10-10 23:34:31,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:31,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:31,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:31,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:31,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:34:31,410 INFO L87 Difference]: Start difference. First operand 893 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:31,991 INFO L93 Difference]: Finished difference Result 2319 states and 2777 transitions. [2024-10-10 23:34:31,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:31,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 339 [2024-10-10 23:34:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:31,999 INFO L225 Difference]: With dead ends: 2319 [2024-10-10 23:34:31,999 INFO L226 Difference]: Without dead ends: 1605 [2024-10-10 23:34:32,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:34:32,001 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 143 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:32,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 262 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:34:32,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-10-10 23:34:32,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1427. [2024-10-10 23:34:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.1402524544179524) internal successors, (1626), 1426 states have internal predecessors, (1626), 0 states have call successors, (0), 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:34:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1626 transitions. [2024-10-10 23:34:32,028 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1626 transitions. Word has length 339 [2024-10-10 23:34:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:32,029 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1626 transitions. [2024-10-10 23:34:32,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1626 transitions. [2024-10-10 23:34:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2024-10-10 23:34:32,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:32,036 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:32,055 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:34:32,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:32,237 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:32,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash 321087242, now seen corresponding path program 1 times [2024-10-10 23:34:32,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:32,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072259271] [2024-10-10 23:34:32,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:32,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-10 23:34:32,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:32,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072259271] [2024-10-10 23:34:32,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072259271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:32,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:32,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:32,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946249615] [2024-10-10 23:34:32,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:32,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:32,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:32,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:32,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:32,814 INFO L87 Difference]: Start difference. First operand 1427 states and 1626 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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:34:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:33,377 INFO L93 Difference]: Finished difference Result 3209 states and 3756 transitions. [2024-10-10 23:34:33,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:33,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 438 [2024-10-10 23:34:33,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:33,384 INFO L225 Difference]: With dead ends: 3209 [2024-10-10 23:34:33,386 INFO L226 Difference]: Without dead ends: 1961 [2024-10-10 23:34:33,388 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:34:33,389 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:33,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 75 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:34:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-10-10 23:34:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2024-10-10 23:34:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.1341189674523007) internal successors, (2021), 1782 states have internal predecessors, (2021), 0 states have call successors, (0), 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:34:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2021 transitions. [2024-10-10 23:34:33,453 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2021 transitions. Word has length 438 [2024-10-10 23:34:33,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:33,454 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2021 transitions. [2024-10-10 23:34:33,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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:34:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2021 transitions. [2024-10-10 23:34:33,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2024-10-10 23:34:33,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:33,462 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 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:34:33,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:34:33,462 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:33,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1476974542, now seen corresponding path program 1 times [2024-10-10 23:34:33,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:33,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633867573] [2024-10-10 23:34:33,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:33,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-10-10 23:34:33,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:33,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633867573] [2024-10-10 23:34:33,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633867573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:33,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:33,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:33,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006393010] [2024-10-10 23:34:33,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:33,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:34:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:33,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:34:33,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:34:33,953 INFO L87 Difference]: Start difference. First operand 1783 states and 2021 transitions. Second operand has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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:34:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:34,764 INFO L93 Difference]: Finished difference Result 3743 states and 4237 transitions. [2024-10-10 23:34:34,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:34:34,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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 462 [2024-10-10 23:34:34,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:34,773 INFO L225 Difference]: With dead ends: 3743 [2024-10-10 23:34:34,774 INFO L226 Difference]: Without dead ends: 2139 [2024-10-10 23:34:34,776 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:34:34,777 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:34,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 87 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:34:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2024-10-10 23:34:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2024-10-10 23:34:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.117867165575304) internal successors, (2390), 2138 states have internal predecessors, (2390), 0 states have call successors, (0), 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:34:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2390 transitions. [2024-10-10 23:34:34,826 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2390 transitions. Word has length 462 [2024-10-10 23:34:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:34,827 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2390 transitions. [2024-10-10 23:34:34,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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:34:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2390 transitions. [2024-10-10 23:34:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2024-10-10 23:34:34,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:34,839 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:34,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:34:34,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:34,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:34,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1029880182, now seen corresponding path program 1 times [2024-10-10 23:34:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:34,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912277076] [2024-10-10 23:34:34,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 698 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2024-10-10 23:34:35,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:35,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912277076] [2024-10-10 23:34:35,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912277076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:35,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:35,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:35,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954104624] [2024-10-10 23:34:35,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:35,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:34:35,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:35,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:34:35,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:34:35,335 INFO L87 Difference]: Start difference. First operand 2139 states and 2390 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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:34:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:35,974 INFO L93 Difference]: Finished difference Result 4335 states and 4848 transitions. [2024-10-10 23:34:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:34:35,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 518 [2024-10-10 23:34:35,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:35,983 INFO L225 Difference]: With dead ends: 4335 [2024-10-10 23:34:35,983 INFO L226 Difference]: Without dead ends: 2317 [2024-10-10 23:34:35,986 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:34:35,987 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:35,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 14 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:34:35,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2024-10-10 23:34:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2139. [2024-10-10 23:34:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.0855940130963517) internal successors, (2321), 2138 states have internal predecessors, (2321), 0 states have call successors, (0), 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:34:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2321 transitions. [2024-10-10 23:34:36,027 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2321 transitions. Word has length 518 [2024-10-10 23:34:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:36,027 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2321 transitions. [2024-10-10 23:34:36,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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:34:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2321 transitions. [2024-10-10 23:34:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2024-10-10 23:34:36,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:36,039 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:36,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:34:36,039 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:36,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1921213675, now seen corresponding path program 2 times [2024-10-10 23:34:36,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:36,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328983207] [2024-10-10 23:34:36,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:36,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 775 proven. 11 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2024-10-10 23:34:36,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:36,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328983207] [2024-10-10 23:34:36,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328983207] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:34:36,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432036722] [2024-10-10 23:34:36,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 23:34:36,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:36,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:34:36,717 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:34:36,718 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:34:36,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 23:34:36,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 23:34:36,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:34:36,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:34:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 786 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2024-10-10 23:34:37,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:34:37,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432036722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:37,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:34:37,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:34:37,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186628790] [2024-10-10 23:34:37,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:37,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:34:37,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:37,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:34:37,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:34:37,695 INFO L87 Difference]: Start difference. First operand 2139 states and 2321 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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:34:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:38,496 INFO L93 Difference]: Finished difference Result 4989 states and 5474 transitions. [2024-10-10 23:34:38,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:34:38,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 544 [2024-10-10 23:34:38,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:38,507 INFO L225 Difference]: With dead ends: 4989 [2024-10-10 23:34:38,507 INFO L226 Difference]: Without dead ends: 3029 [2024-10-10 23:34:38,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:34:38,511 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 161 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:38,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 13 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:34:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2024-10-10 23:34:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 2495. [2024-10-10 23:34:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2494 states have (on average 1.0789895749799518) internal successors, (2691), 2494 states have internal predecessors, (2691), 0 states have call successors, (0), 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:34:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 2691 transitions. [2024-10-10 23:34:38,556 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 2691 transitions. Word has length 544 [2024-10-10 23:34:38,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:38,557 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 2691 transitions. [2024-10-10 23:34:38,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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:34:38,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2691 transitions. [2024-10-10 23:34:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2024-10-10 23:34:38,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:38,562 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:38,582 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:34:38,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:38,767 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:38,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:38,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1243204322, now seen corresponding path program 1 times [2024-10-10 23:34:38,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:38,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595739856] [2024-10-10 23:34:38,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:38,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 788 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2024-10-10 23:34:39,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:39,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595739856] [2024-10-10 23:34:39,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595739856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:39,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:39,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620966933] [2024-10-10 23:34:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:39,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:39,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:39,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:39,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:39,272 INFO L87 Difference]: Start difference. First operand 2495 states and 2691 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 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:34:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:39,784 INFO L93 Difference]: Finished difference Result 5701 states and 6215 transitions. [2024-10-10 23:34:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:39,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 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 551 [2024-10-10 23:34:39,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:39,795 INFO L225 Difference]: With dead ends: 5701 [2024-10-10 23:34:39,796 INFO L226 Difference]: Without dead ends: 3385 [2024-10-10 23:34:39,799 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:34:39,800 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:39,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 200 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:34:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2024-10-10 23:34:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3207. [2024-10-10 23:34:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.0770430442919525) internal successors, (3453), 3206 states have internal predecessors, (3453), 0 states have call successors, (0), 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:34:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 3453 transitions. [2024-10-10 23:34:39,853 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 3453 transitions. Word has length 551 [2024-10-10 23:34:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:39,854 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 3453 transitions. [2024-10-10 23:34:39,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 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:34:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 3453 transitions. [2024-10-10 23:34:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2024-10-10 23:34:39,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:39,860 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:39,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:34:39,861 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:39,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1354211923, now seen corresponding path program 1 times [2024-10-10 23:34:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:39,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576380984] [2024-10-10 23:34:39,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:39,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 802 proven. 195 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-10 23:34:40,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:40,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576380984] [2024-10-10 23:34:40,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576380984] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:34:40,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218731443] [2024-10-10 23:34:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:40,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:40,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:34:40,791 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:34:40,792 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:34:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:41,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:34:41,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:34:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2024-10-10 23:34:42,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:34:42,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218731443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:42,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:34:42,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-10 23:34:42,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032354480] [2024-10-10 23:34:42,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:42,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:42,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:42,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:42,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:34:42,403 INFO L87 Difference]: Start difference. First operand 3207 states and 3453 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 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:34:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:42,864 INFO L93 Difference]: Finished difference Result 6413 states and 6914 transitions. [2024-10-10 23:34:42,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:42,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 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 596 [2024-10-10 23:34:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:42,875 INFO L225 Difference]: With dead ends: 6413 [2024-10-10 23:34:42,876 INFO L226 Difference]: Without dead ends: 3385 [2024-10-10 23:34:42,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:34:42,880 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:42,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 46 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:34:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2024-10-10 23:34:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3385. [2024-10-10 23:34:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.0688534278959811) internal successors, (3617), 3384 states have internal predecessors, (3617), 0 states have call successors, (0), 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:34:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 3617 transitions. [2024-10-10 23:34:42,953 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 3617 transitions. Word has length 596 [2024-10-10 23:34:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:42,954 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 3617 transitions. [2024-10-10 23:34:42,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 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:34:42,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 3617 transitions. [2024-10-10 23:34:42,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2024-10-10 23:34:42,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:42,960 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 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] [2024-10-10 23:34:42,978 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:34:43,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:43,165 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:43,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:43,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2095710921, now seen corresponding path program 1 times [2024-10-10 23:34:43,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:43,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016043005] [2024-10-10 23:34:43,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:43,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2024-10-10 23:34:43,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:43,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016043005] [2024-10-10 23:34:43,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016043005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:43,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:43,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137925011] [2024-10-10 23:34:43,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:43,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:43,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:43,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:43,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:43,508 INFO L87 Difference]: Start difference. First operand 3385 states and 3617 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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:34:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:44,032 INFO L93 Difference]: Finished difference Result 7837 states and 8444 transitions. [2024-10-10 23:34:44,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:44,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 618 [2024-10-10 23:34:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:44,046 INFO L225 Difference]: With dead ends: 7837 [2024-10-10 23:34:44,047 INFO L226 Difference]: Without dead ends: 4631 [2024-10-10 23:34:44,051 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:34:44,051 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:44,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 55 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:34:44,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2024-10-10 23:34:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 4631. [2024-10-10 23:34:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.0632829373650108) internal successors, (4923), 4630 states have internal predecessors, (4923), 0 states have call successors, (0), 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:34:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4923 transitions. [2024-10-10 23:34:44,119 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4923 transitions. Word has length 618 [2024-10-10 23:34:44,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:44,120 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4923 transitions. [2024-10-10 23:34:44,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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:34:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4923 transitions. [2024-10-10 23:34:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2024-10-10 23:34:44,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:44,152 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:34:44,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:34:44,152 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:44,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:44,153 INFO L85 PathProgramCache]: Analyzing trace with hash -541966102, now seen corresponding path program 1 times [2024-10-10 23:34:44,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:44,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687975150] [2024-10-10 23:34:44,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:44,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1234 proven. 155 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2024-10-10 23:34:44,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:44,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687975150] [2024-10-10 23:34:44,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687975150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:34:44,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605109673] [2024-10-10 23:34:44,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:44,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:44,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:34:44,661 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:34:44,692 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:34:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:44,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:34:44,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:34:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1234 proven. 155 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2024-10-10 23:34:45,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:34:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1234 proven. 155 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2024-10-10 23:34:45,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605109673] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:34:45,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:34:45,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-10 23:34:45,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167843187] [2024-10-10 23:34:45,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:34:45,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 23:34:45,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:45,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 23:34:45,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:34:45,673 INFO L87 Difference]: Start difference. First operand 4631 states and 4923 transitions. Second operand has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 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:34:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:46,493 INFO L93 Difference]: Finished difference Result 10507 states and 11208 transitions. [2024-10-10 23:34:46,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:34:46,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 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 773 [2024-10-10 23:34:46,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:46,512 INFO L225 Difference]: With dead ends: 10507 [2024-10-10 23:34:46,512 INFO L226 Difference]: Without dead ends: 6055 [2024-10-10 23:34:46,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1548 GetRequests, 1544 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:34:46,519 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 51 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:46,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 61 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:34:46,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2024-10-10 23:34:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 5343. [2024-10-10 23:34:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5343 states, 5342 states have (on average 1.0640209659303632) internal successors, (5684), 5342 states have internal predecessors, (5684), 0 states have call successors, (0), 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:34:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 5684 transitions. [2024-10-10 23:34:46,635 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 5684 transitions. Word has length 773 [2024-10-10 23:34:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:46,637 INFO L471 AbstractCegarLoop]: Abstraction has 5343 states and 5684 transitions. [2024-10-10 23:34:46,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 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:34:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 5684 transitions. [2024-10-10 23:34:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2024-10-10 23:34:46,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:46,651 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2024-10-10 23:34:46,670 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:34:46,855 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,SelfDestructingSolverStorable12 [2024-10-10 23:34:46,856 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:46,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:46,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1682580277, now seen corresponding path program 1 times [2024-10-10 23:34:46,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:46,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472766783] [2024-10-10 23:34:46,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:46,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 1665 proven. 0 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2024-10-10 23:34:47,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:47,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472766783] [2024-10-10 23:34:47,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472766783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:47,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:47,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:47,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652529614] [2024-10-10 23:34:47,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:47,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:47,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:47,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:47,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:47,669 INFO L87 Difference]: Start difference. First operand 5343 states and 5684 transitions. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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:34:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:48,063 INFO L93 Difference]: Finished difference Result 10685 states and 11376 transitions. [2024-10-10 23:34:48,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:48,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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 824 [2024-10-10 23:34:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:48,075 INFO L225 Difference]: With dead ends: 10685 [2024-10-10 23:34:48,075 INFO L226 Difference]: Without dead ends: 5521 [2024-10-10 23:34:48,084 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:34:48,085 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 51 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:48,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 239 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:34:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5521 states. [2024-10-10 23:34:48,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5521 to 5165. [2024-10-10 23:34:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5164 states have (on average 1.0613865220759102) internal successors, (5481), 5164 states have internal predecessors, (5481), 0 states have call successors, (0), 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:34:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 5481 transitions. [2024-10-10 23:34:48,146 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 5481 transitions. Word has length 824 [2024-10-10 23:34:48,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:48,147 INFO L471 AbstractCegarLoop]: Abstraction has 5165 states and 5481 transitions. [2024-10-10 23:34:48,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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:34:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 5481 transitions. [2024-10-10 23:34:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2024-10-10 23:34:48,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:48,155 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:34:48,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:34:48,155 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:48,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:48,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1165075734, now seen corresponding path program 1 times [2024-10-10 23:34:48,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:48,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367272946] [2024-10-10 23:34:48,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:48,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2206 backedges. 1415 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2024-10-10 23:34:48,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:48,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367272946] [2024-10-10 23:34:48,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367272946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:48,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:48,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:48,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636464581] [2024-10-10 23:34:48,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:48,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:48,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:48,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:48,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:48,626 INFO L87 Difference]: Start difference. First operand 5165 states and 5481 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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:34:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:49,095 INFO L93 Difference]: Finished difference Result 11219 states and 12001 transitions. [2024-10-10 23:34:49,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:49,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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 845 [2024-10-10 23:34:49,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:49,115 INFO L225 Difference]: With dead ends: 11219 [2024-10-10 23:34:49,115 INFO L226 Difference]: Without dead ends: 6233 [2024-10-10 23:34:49,124 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:34:49,125 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 107 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:49,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 31 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:34:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2024-10-10 23:34:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 6233. [2024-10-10 23:34:49,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6233 states, 6232 states have (on average 1.0659499358151476) internal successors, (6643), 6232 states have internal predecessors, (6643), 0 states have call successors, (0), 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:34:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6233 states to 6233 states and 6643 transitions. [2024-10-10 23:34:49,209 INFO L78 Accepts]: Start accepts. Automaton has 6233 states and 6643 transitions. Word has length 845 [2024-10-10 23:34:49,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:49,210 INFO L471 AbstractCegarLoop]: Abstraction has 6233 states and 6643 transitions. [2024-10-10 23:34:49,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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:34:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 6233 states and 6643 transitions. [2024-10-10 23:34:49,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2024-10-10 23:34:49,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:49,218 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:49,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:34:49,219 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:49,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:49,219 INFO L85 PathProgramCache]: Analyzing trace with hash -185076873, now seen corresponding path program 1 times [2024-10-10 23:34:49,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:49,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830562772] [2024-10-10 23:34:49,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:49,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 1483 proven. 93 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-10-10 23:34:49,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:49,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830562772] [2024-10-10 23:34:49,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830562772] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:34:49,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32210310] [2024-10-10 23:34:49,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:49,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:49,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:34:49,996 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:34:49,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 23:34:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:50,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:34:50,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:34:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 1576 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-10-10 23:34:50,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:34:50,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32210310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:50,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:34:50,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:34:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107106239] [2024-10-10 23:34:50,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:50,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:50,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:50,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:50,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:34:50,800 INFO L87 Difference]: Start difference. First operand 6233 states and 6643 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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:34:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:51,275 INFO L93 Difference]: Finished difference Result 12643 states and 13472 transitions. [2024-10-10 23:34:51,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:51,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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 863 [2024-10-10 23:34:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:51,288 INFO L225 Difference]: With dead ends: 12643 [2024-10-10 23:34:51,288 INFO L226 Difference]: Without dead ends: 6589 [2024-10-10 23:34:51,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 862 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:34:51,295 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:51,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:34:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6589 states. [2024-10-10 23:34:51,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6589 to 6411. [2024-10-10 23:34:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6411 states, 6410 states have (on average 1.064742589703588) internal successors, (6825), 6410 states have internal predecessors, (6825), 0 states have call successors, (0), 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:34:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6411 states to 6411 states and 6825 transitions. [2024-10-10 23:34:51,371 INFO L78 Accepts]: Start accepts. Automaton has 6411 states and 6825 transitions. Word has length 863 [2024-10-10 23:34:51,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:51,372 INFO L471 AbstractCegarLoop]: Abstraction has 6411 states and 6825 transitions. [2024-10-10 23:34:51,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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:34:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 6825 transitions. [2024-10-10 23:34:51,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2024-10-10 23:34:51,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:51,381 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:34:51,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 23:34:51,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 23:34:51,582 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:51,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2046256961, now seen corresponding path program 1 times [2024-10-10 23:34:51,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:51,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960740034] [2024-10-10 23:34:51,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2493 backedges. 1702 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2024-10-10 23:34:52,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:52,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960740034] [2024-10-10 23:34:52,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960740034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:52,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:52,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:52,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849900165] [2024-10-10 23:34:52,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:52,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:52,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:52,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:52,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:52,303 INFO L87 Difference]: Start difference. First operand 6411 states and 6825 transitions. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 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:34:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:52,670 INFO L93 Difference]: Finished difference Result 12465 states and 13290 transitions. [2024-10-10 23:34:52,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:52,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 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 931 [2024-10-10 23:34:52,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:52,681 INFO L225 Difference]: With dead ends: 12465 [2024-10-10 23:34:52,681 INFO L226 Difference]: Without dead ends: 6233 [2024-10-10 23:34:52,687 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:34:52,688 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:52,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 224 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:34:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2024-10-10 23:34:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 6233. [2024-10-10 23:34:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6233 states, 6232 states have (on average 1.0582477535301669) internal successors, (6595), 6232 states have internal predecessors, (6595), 0 states have call successors, (0), 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:34:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6233 states to 6233 states and 6595 transitions. [2024-10-10 23:34:52,758 INFO L78 Accepts]: Start accepts. Automaton has 6233 states and 6595 transitions. Word has length 931 [2024-10-10 23:34:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:52,759 INFO L471 AbstractCegarLoop]: Abstraction has 6233 states and 6595 transitions. [2024-10-10 23:34:52,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 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:34:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6233 states and 6595 transitions. [2024-10-10 23:34:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 941 [2024-10-10 23:34:52,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:52,796 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:34:52,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:34:52,797 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:52,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1109865849, now seen corresponding path program 1 times [2024-10-10 23:34:52,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:52,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188677477] [2024-10-10 23:34:52,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:52,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1777 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2024-10-10 23:34:53,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188677477] [2024-10-10 23:34:53,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188677477] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:34:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084621304] [2024-10-10 23:34:53,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:53,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:53,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:34:53,970 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:34:53,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 23:34:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:54,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 1163 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 23:34:54,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:34:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1777 proven. 625 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2024-10-10 23:34:55,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:34:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1849 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2024-10-10 23:34:55,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084621304] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:34:55,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:34:55,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2024-10-10 23:34:55,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431266671] [2024-10-10 23:34:55,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:55,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:34:55,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:55,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:34:55,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:34:55,593 INFO L87 Difference]: Start difference. First operand 6233 states and 6595 transitions. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 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:34:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:56,109 INFO L93 Difference]: Finished difference Result 12643 states and 13388 transitions. [2024-10-10 23:34:56,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:34:56,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 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 940 [2024-10-10 23:34:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:56,122 INFO L225 Difference]: With dead ends: 12643 [2024-10-10 23:34:56,122 INFO L226 Difference]: Without dead ends: 6589 [2024-10-10 23:34:56,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1883 GetRequests, 1875 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:34:56,129 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 147 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:56,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 7 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:34:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6589 states. [2024-10-10 23:34:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6589 to 6411. [2024-10-10 23:34:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6411 states, 6410 states have (on average 1.0563182527301092) internal successors, (6771), 6410 states have internal predecessors, (6771), 0 states have call successors, (0), 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:34:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6411 states to 6411 states and 6771 transitions. [2024-10-10 23:34:56,205 INFO L78 Accepts]: Start accepts. Automaton has 6411 states and 6771 transitions. Word has length 940 [2024-10-10 23:34:56,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:56,206 INFO L471 AbstractCegarLoop]: Abstraction has 6411 states and 6771 transitions. [2024-10-10 23:34:56,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 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:34:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 6771 transitions. [2024-10-10 23:34:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1185 [2024-10-10 23:34:56,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:56,219 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:34:56,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-10 23:34:56,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 23:34:56,420 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:56,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:56,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2079452258, now seen corresponding path program 1 times [2024-10-10 23:34:56,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:56,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874356610] [2024-10-10 23:34:56,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:56,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4582 backedges. 3412 proven. 72 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2024-10-10 23:34:57,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:57,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874356610] [2024-10-10 23:34:57,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874356610] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:34:57,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645624743] [2024-10-10 23:34:57,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:57,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:57,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:34:57,712 INFO L229 MonitoredProcess]: Starting monitored process 8 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:34:57,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 23:34:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:58,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 23:34:58,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:34:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4582 backedges. 3371 proven. 666 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2024-10-10 23:34:58,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:34:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4582 backedges. 3484 proven. 0 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2024-10-10 23:34:59,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645624743] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:34:59,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:34:59,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2024-10-10 23:34:59,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247997377] [2024-10-10 23:34:59,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:59,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:34:59,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:59,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:34:59,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:34:59,235 INFO L87 Difference]: Start difference. First operand 6411 states and 6771 transitions. Second operand has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 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:34:59,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:59,689 INFO L93 Difference]: Finished difference Result 12643 states and 13362 transitions. [2024-10-10 23:34:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:34:59,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 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 1184 [2024-10-10 23:34:59,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:59,702 INFO L225 Difference]: With dead ends: 12643 [2024-10-10 23:34:59,702 INFO L226 Difference]: Without dead ends: 6411 [2024-10-10 23:34:59,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2371 GetRequests, 2364 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:34:59,709 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 79 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:59,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 7 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:34:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2024-10-10 23:34:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 6233. [2024-10-10 23:34:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6233 states, 6232 states have (on average 1.0547175866495506) internal successors, (6573), 6232 states have internal predecessors, (6573), 0 states have call successors, (0), 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:34:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6233 states to 6233 states and 6573 transitions. [2024-10-10 23:34:59,780 INFO L78 Accepts]: Start accepts. Automaton has 6233 states and 6573 transitions. Word has length 1184 [2024-10-10 23:34:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:59,781 INFO L471 AbstractCegarLoop]: Abstraction has 6233 states and 6573 transitions. [2024-10-10 23:34:59,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 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:34:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6233 states and 6573 transitions. [2024-10-10 23:34:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1472 [2024-10-10 23:34:59,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:59,799 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:59,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-10 23:34:59,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:00,001 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:00,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:00,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1060494911, now seen corresponding path program 1 times [2024-10-10 23:35:00,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:00,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491116188] [2024-10-10 23:35:00,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:00,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 5384 proven. 304 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2024-10-10 23:35:01,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:01,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491116188] [2024-10-10 23:35:01,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491116188] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:35:01,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862514038] [2024-10-10 23:35:01,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:01,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:01,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:35:01,818 INFO L229 MonitoredProcess]: Starting monitored process 9 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:35:01,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 23:35:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:02,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 1779 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 23:35:02,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:35:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 5059 proven. 716 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2024-10-10 23:35:02,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:35:03,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 5222 proven. 0 refuted. 0 times theorem prover too weak. 1673 trivial. 0 not checked. [2024-10-10 23:35:03,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862514038] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:35:03,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:35:03,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 10 [2024-10-10 23:35:03,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084713183] [2024-10-10 23:35:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:03,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:35:03,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:03,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:35:03,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:35:03,532 INFO L87 Difference]: Start difference. First operand 6233 states and 6573 transitions. Second operand has 5 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 0 states have call successors, (0), 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:35:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:04,027 INFO L93 Difference]: Finished difference Result 12287 states and 12966 transitions. [2024-10-10 23:35:04,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:35:04,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 0 states have call successors, (0), 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 1471 [2024-10-10 23:35:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:04,039 INFO L225 Difference]: With dead ends: 12287 [2024-10-10 23:35:04,039 INFO L226 Difference]: Without dead ends: 6233 [2024-10-10 23:35:04,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2946 GetRequests, 2938 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:35:04,046 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:04,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 8 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:35:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2024-10-10 23:35:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 5521. [2024-10-10 23:35:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5521 states, 5520 states have (on average 1.0556159420289855) internal successors, (5827), 5520 states have internal predecessors, (5827), 0 states have call successors, (0), 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:35:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5521 states to 5521 states and 5827 transitions. [2024-10-10 23:35:04,108 INFO L78 Accepts]: Start accepts. Automaton has 5521 states and 5827 transitions. Word has length 1471 [2024-10-10 23:35:04,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:04,108 INFO L471 AbstractCegarLoop]: Abstraction has 5521 states and 5827 transitions. [2024-10-10 23:35:04,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 0 states have call successors, (0), 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:35:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 5521 states and 5827 transitions. [2024-10-10 23:35:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1727 [2024-10-10 23:35:04,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:04,129 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:04,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-10 23:35:04,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:04,330 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:04,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:04,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1335514862, now seen corresponding path program 1 times [2024-10-10 23:35:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:04,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038828416] [2024-10-10 23:35:04,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:04,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:05,333 INFO L134 CoverageAnalysis]: Checked inductivity of 9684 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 9181 trivial. 0 not checked. [2024-10-10 23:35:05,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:05,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038828416] [2024-10-10 23:35:05,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038828416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:05,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:05,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:05,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645071424] [2024-10-10 23:35:05,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:05,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:35:05,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:05,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:35:05,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:05,336 INFO L87 Difference]: Start difference. First operand 5521 states and 5827 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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:35:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:05,844 INFO L93 Difference]: Finished difference Result 10695 states and 11288 transitions. [2024-10-10 23:35:05,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:35:05,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 1726 [2024-10-10 23:35:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:05,846 INFO L225 Difference]: With dead ends: 10695 [2024-10-10 23:35:05,846 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:35:05,851 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:35:05,851 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:05,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 12 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:35:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:35:05,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:35:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:35:05,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1726 [2024-10-10 23:35:05,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:05,854 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:35:05,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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:35:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:35:05,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:35:05,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:35:05,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:35:05,862 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:05,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:35:06,375 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:35:06,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:35:06 BoogieIcfgContainer [2024-10-10 23:35:06,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:35:06,393 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:35:06,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:35:06,393 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:35:06,393 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:34:26" (3/4) ... [2024-10-10 23:35:06,396 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:35:06,417 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:35:06,418 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:35:06,419 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:35:06,420 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:35:06,597 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:35:06,598 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:35:06,598 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:35:06,599 INFO L158 Benchmark]: Toolchain (without parser) took 42756.71ms. Allocated memory was 125.8MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 68.8MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 133.6MB. Max. memory is 16.1GB. [2024-10-10 23:35:06,599 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:35:06,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.23ms. Allocated memory was 125.8MB in the beginning and 178.3MB in the end (delta: 52.4MB). Free memory was 68.5MB in the beginning and 142.2MB in the end (delta: -73.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-10 23:35:06,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.55ms. Allocated memory is still 178.3MB. Free memory was 142.2MB in the beginning and 132.7MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:35:06,599 INFO L158 Benchmark]: Boogie Preprocessor took 135.12ms. Allocated memory is still 178.3MB. Free memory was 132.7MB in the beginning and 120.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 23:35:06,600 INFO L158 Benchmark]: RCFGBuilder took 1482.99ms. Allocated memory is still 178.3MB. Free memory was 120.1MB in the beginning and 134.3MB in the end (delta: -14.2MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2024-10-10 23:35:06,600 INFO L158 Benchmark]: TraceAbstraction took 40170.16ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 133.2MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 658.6MB. Max. memory is 16.1GB. [2024-10-10 23:35:06,600 INFO L158 Benchmark]: Witness Printer took 205.36ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 23:35:06,601 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.23ms. Allocated memory was 125.8MB in the beginning and 178.3MB in the end (delta: 52.4MB). Free memory was 68.5MB in the beginning and 142.2MB in the end (delta: -73.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.55ms. Allocated memory is still 178.3MB. Free memory was 142.2MB in the beginning and 132.7MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 135.12ms. Allocated memory is still 178.3MB. Free memory was 132.7MB in the beginning and 120.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1482.99ms. Allocated memory is still 178.3MB. Free memory was 120.1MB in the beginning and 134.3MB in the end (delta: -14.2MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. * TraceAbstraction took 40170.16ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 133.2MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 658.6MB. Max. memory is 16.1GB. * Witness Printer took 205.36ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 128]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.6s, OverallIterations: 21, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2016 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2016 mSDsluCounter, 1878 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 1532 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10866 IncrementalHoareTripleChecker+Invalid, 12398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1532 mSolverCounterUnsat, 1777 mSDtfsCounter, 10866 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11142 GetRequests, 11078 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6411occurred in iteration=16, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 3738 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 20800 NumberOfCodeBlocks, 20800 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 25135 ConstructedInterpolants, 0 QuantifiedInterpolants, 69218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 8315 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 33 InterpolantComputations, 20 PerfectInterpolantSequences, 76083/79432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((((((((long long) a12 + 43) <= 0) && (a24 == 1)) || (((a15 <= 8) && (a21 <= 6)) && (((long long) 49 + a12) <= 0))) || (((a21 <= 9) && (a24 == 1)) && (a12 <= 600006))) || (((a24 == 1) && (7 != a15)) && (a12 <= 600006))) || ((((a24 == 1) && (a12 <= 600006)) && (a21 == 10)) && (81 <= a12))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:35:06,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE