./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/Problem19_label45.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/Problem19_label45.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 80a9d77596eed268b316c6bc5991cccbe6552bee72fbd476389165b1c4f714b5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:00:15,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:00:15,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 00:00:15,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:00:15,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:00:15,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:00:15,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:00:15,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:00:15,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:00:15,125 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:00:15,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:00:15,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:00:15,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:00:15,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:00:15,129 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:00:15,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:00:15,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:00:15,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:00:15,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 00:00:15,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:00:15,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:00:15,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:00:15,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:00:15,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:00:15,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:00:15,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:00:15,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:00:15,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:00:15,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:00:15,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:00:15,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:00:15,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:00:15,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:00:15,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:00:15,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:00:15,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:00:15,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 00:00:15,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 00:00:15,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:00:15,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:00:15,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:00:15,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:00:15,141 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 -> 80a9d77596eed268b316c6bc5991cccbe6552bee72fbd476389165b1c4f714b5 [2024-10-11 00:00:15,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:00:15,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:00:15,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:00:15,470 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:00:15,470 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:00:15,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label45.c [2024-10-11 00:00:16,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:00:17,668 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:00:17,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label45.c [2024-10-11 00:00:17,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c4a647b9f/e354b51981b44857ad3037a9c8917aa8/FLAGcf6fc2aff [2024-10-11 00:00:17,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c4a647b9f/e354b51981b44857ad3037a9c8917aa8 [2024-10-11 00:00:17,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:00:17,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:00:17,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:00:17,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:00:17,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:00:17,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:00:17" (1/1) ... [2024-10-11 00:00:17,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761db1d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:17, skipping insertion in model container [2024-10-11 00:00:17,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:00:17" (1/1) ... [2024-10-11 00:00:17,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:00:18,374 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/Problem19_label45.c[6276,6289] [2024-10-11 00:00:19,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:00:19,651 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:00:19,683 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/Problem19_label45.c[6276,6289] [2024-10-11 00:00:20,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:00:20,510 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:00:20,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:20 WrapperNode [2024-10-11 00:00:20,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:00:20,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:00:20,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:00:20,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:00:20,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:20" (1/1) ... [2024-10-11 00:00:20,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:20" (1/1) ... [2024-10-11 00:00:21,748 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9431 [2024-10-11 00:00:21,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:00:21,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:00:21,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:00:21,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:00:21,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:20" (1/1) ... [2024-10-11 00:00:21,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:20" (1/1) ... [2024-10-11 00:00:22,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:20" (1/1) ... [2024-10-11 00:00:22,584 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-11 00:00:22,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:20" (1/1) ... [2024-10-11 00:00:22,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:20" (1/1) ... [2024-10-11 00:00:22,862 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:20" (1/1) ... [2024-10-11 00:00:22,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:20" (1/1) ... [2024-10-11 00:00:23,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:20" (1/1) ... [2024-10-11 00:00:23,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:20" (1/1) ... [2024-10-11 00:00:23,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:00:23,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:00:23,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:00:23,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:00:23,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:20" (1/1) ... [2024-10-11 00:00:23,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:00:23,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:00:23,333 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-11 00:00:23,336 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-11 00:00:23,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:00:23,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 00:00:23,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:00:23,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:00:23,476 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:00:23,479 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:00:31,372 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2024-10-11 00:00:31,372 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:00:31,463 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:00:31,464 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 00:00:31,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:00:31 BoogieIcfgContainer [2024-10-11 00:00:31,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:00:31,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:00:31,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:00:31,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:00:31,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:00:17" (1/3) ... [2024-10-11 00:00:31,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f742c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:00:31, skipping insertion in model container [2024-10-11 00:00:31,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:00:20" (2/3) ... [2024-10-11 00:00:31,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f742c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:00:31, skipping insertion in model container [2024-10-11 00:00:31,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:00:31" (3/3) ... [2024-10-11 00:00:31,476 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label45.c [2024-10-11 00:00:31,492 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:00:31,492 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:00:31,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:00:31,613 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;@176afe6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:00:31,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:00:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 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-11 00:00:31,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 00:00:31,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:31,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:31,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:31,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:31,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1141943108, now seen corresponding path program 1 times [2024-10-11 00:00:31,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:31,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420757707] [2024-10-11 00:00:31,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:31,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:31,851 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-11 00:00:31,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:31,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420757707] [2024-10-11 00:00:31,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420757707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:31,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:31,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:00:31,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836180983] [2024-10-11 00:00:31,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:31,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 00:00:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:31,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 00:00:31,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:00:31,900 INFO L87 Difference]: Start difference. First operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 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 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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-11 00:00:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:32,015 INFO L93 Difference]: Finished difference Result 3371 states and 6405 transitions. [2024-10-11 00:00:32,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 00:00:32,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-11 00:00:32,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:32,043 INFO L225 Difference]: With dead ends: 3371 [2024-10-11 00:00:32,044 INFO L226 Difference]: Without dead ends: 1684 [2024-10-11 00:00:32,054 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-11 00:00:32,057 INFO L432 NwaCegarLoop]: 3138 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, 3138 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-11 00:00:32,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3138 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:00:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-10-11 00:00:32,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2024-10-11 00:00:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 0 states have call successors, (0), 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-11 00:00:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2024-10-11 00:00:32,187 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 46 [2024-10-11 00:00:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:32,187 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2024-10-11 00:00:32,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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-11 00:00:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2024-10-11 00:00:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 00:00:32,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:32,189 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:32,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 00:00:32,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:32,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:32,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1299373560, now seen corresponding path program 1 times [2024-10-11 00:00:32,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:32,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829083461] [2024-10-11 00:00:32,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:32,588 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-11 00:00:32,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:32,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829083461] [2024-10-11 00:00:32,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829083461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:32,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:32,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:00:32,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817362314] [2024-10-11 00:00:32,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:32,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:00:32,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:32,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:00:32,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:00:32,595 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-11 00:00:42,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:42,837 INFO L93 Difference]: Finished difference Result 6152 states and 11658 transitions. [2024-10-11 00:00:42,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:00:42,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-11 00:00:42,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:42,858 INFO L225 Difference]: With dead ends: 6152 [2024-10-11 00:00:42,858 INFO L226 Difference]: Without dead ends: 4469 [2024-10-11 00:00:42,861 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-11 00:00:42,863 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 4542 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 6996 mSolverCounterSat, 3571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4542 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 10567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3571 IncrementalHoareTripleChecker+Valid, 6996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:42,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4542 Valid, 968 Invalid, 10567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3571 Valid, 6996 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2024-10-11 00:00:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2024-10-11 00:00:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 4466. [2024-10-11 00:00:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4466 states, 4465 states have (on average 1.5686450167973125) internal successors, (7004), 4465 states have internal predecessors, (7004), 0 states have call successors, (0), 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-11 00:00:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 7004 transitions. [2024-10-11 00:00:42,982 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 7004 transitions. Word has length 46 [2024-10-11 00:00:42,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:42,983 INFO L471 AbstractCegarLoop]: Abstraction has 4466 states and 7004 transitions. [2024-10-11 00:00:42,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-11 00:00:42,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 7004 transitions. [2024-10-11 00:00:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-11 00:00:42,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:42,994 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:42,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 00:00:42,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:42,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:42,996 INFO L85 PathProgramCache]: Analyzing trace with hash 938277699, now seen corresponding path program 1 times [2024-10-11 00:00:42,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:42,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238339227] [2024-10-11 00:00:42,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:42,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 00:00:44,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:44,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238339227] [2024-10-11 00:00:44,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238339227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:44,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:44,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:00:44,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913401253] [2024-10-11 00:00:44,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:44,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:00:44,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:44,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:00:44,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:00:44,426 INFO L87 Difference]: Start difference. First operand 4466 states and 7004 transitions. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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-11 00:00:53,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:53,922 INFO L93 Difference]: Finished difference Result 11708 states and 20251 transitions. [2024-10-11 00:00:53,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:00:53,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 320 [2024-10-11 00:00:53,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:53,955 INFO L225 Difference]: With dead ends: 11708 [2024-10-11 00:00:53,956 INFO L226 Difference]: Without dead ends: 8608 [2024-10-11 00:00:53,962 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-11 00:00:53,964 INFO L432 NwaCegarLoop]: 1802 mSDtfsCounter, 3755 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 9458 mSolverCounterSat, 1343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3755 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 10801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1343 IncrementalHoareTripleChecker+Valid, 9458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:53,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3755 Valid, 2156 Invalid, 10801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1343 Valid, 9458 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2024-10-11 00:00:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8608 states. [2024-10-11 00:00:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8608 to 8594. [2024-10-11 00:00:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8594 states, 8593 states have (on average 1.3509833585476552) internal successors, (11609), 8593 states have internal predecessors, (11609), 0 states have call successors, (0), 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-11 00:00:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8594 states to 8594 states and 11609 transitions. [2024-10-11 00:00:54,145 INFO L78 Accepts]: Start accepts. Automaton has 8594 states and 11609 transitions. Word has length 320 [2024-10-11 00:00:54,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:54,147 INFO L471 AbstractCegarLoop]: Abstraction has 8594 states and 11609 transitions. [2024-10-11 00:00:54,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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-11 00:00:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 8594 states and 11609 transitions. [2024-10-11 00:00:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-11 00:00:54,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:54,157 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:54,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 00:00:54,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:54,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:54,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1410832541, now seen corresponding path program 1 times [2024-10-11 00:00:54,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:54,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895442906] [2024-10-11 00:00:54,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:54,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 00:00:54,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:54,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895442906] [2024-10-11 00:00:54,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895442906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:54,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:54,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:00:54,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473667300] [2024-10-11 00:00:54,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:54,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:00:54,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:54,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:00:54,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:00:54,924 INFO L87 Difference]: Start difference. First operand 8594 states and 11609 transitions. Second operand has 4 states, 4 states have (on average 82.5) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-11 00:01:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:01:00,216 INFO L93 Difference]: Finished difference Result 14488 states and 20500 transitions. [2024-10-11 00:01:00,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:01:00,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 348 [2024-10-11 00:01:00,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:01:00,238 INFO L225 Difference]: With dead ends: 14488 [2024-10-11 00:01:00,238 INFO L226 Difference]: Without dead ends: 8594 [2024-10-11 00:01:00,248 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-11 00:01:00,249 INFO L432 NwaCegarLoop]: 1774 mSDtfsCounter, 1151 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5717 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 5725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:01:00,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1952 Invalid, 5725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5717 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-11 00:01:00,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8594 states. [2024-10-11 00:01:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8594 to 8594. [2024-10-11 00:01:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8594 states, 8593 states have (on average 1.3494704992435704) internal successors, (11596), 8593 states have internal predecessors, (11596), 0 states have call successors, (0), 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-11 00:01:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8594 states to 8594 states and 11596 transitions. [2024-10-11 00:01:00,426 INFO L78 Accepts]: Start accepts. Automaton has 8594 states and 11596 transitions. Word has length 348 [2024-10-11 00:01:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:01:00,427 INFO L471 AbstractCegarLoop]: Abstraction has 8594 states and 11596 transitions. [2024-10-11 00:01:00,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-11 00:01:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 8594 states and 11596 transitions. [2024-10-11 00:01:00,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2024-10-11 00:01:00,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:01:00,439 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:01:00,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 00:01:00,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:01:00,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:01:00,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1144518698, now seen corresponding path program 1 times [2024-10-11 00:01:00,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:01:00,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386276734] [2024-10-11 00:01:00,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:01:00,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:01:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:01:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 111 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:01:01,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:01:01,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386276734] [2024-10-11 00:01:01,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386276734] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:01:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742549452] [2024-10-11 00:01:01,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:01:01,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:01:01,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:01:01,495 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-11 00:01:01,498 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-11 00:01:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:01:01,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 00:01:01,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:01:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:01:01,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:01:01,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742549452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:01:01,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 00:01:01,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 00:01:01,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124406480] [2024-10-11 00:01:01,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:01:01,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:01:01,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:01:01,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:01:01,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 00:01:01,983 INFO L87 Difference]: Start difference. First operand 8594 states and 11596 transitions. Second operand has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 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-11 00:01:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:01:07,632 INFO L93 Difference]: Finished difference Result 19938 states and 28771 transitions. [2024-10-11 00:01:07,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:01:07,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 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 600 [2024-10-11 00:01:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:01:07,668 INFO L225 Difference]: With dead ends: 19938 [2024-10-11 00:01:07,669 INFO L226 Difference]: Without dead ends: 14075 [2024-10-11 00:01:07,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 00:01:07,681 INFO L432 NwaCegarLoop]: 1368 mSDtfsCounter, 1742 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 3872 mSolverCounterSat, 1728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 5600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1728 IncrementalHoareTripleChecker+Valid, 3872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-11 00:01:07,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 1506 Invalid, 5600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1728 Valid, 3872 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-11 00:01:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14075 states. [2024-10-11 00:01:07,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14075 to 14075. [2024-10-11 00:01:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14075 states, 14074 states have (on average 1.271706693193122) internal successors, (17898), 14074 states have internal predecessors, (17898), 0 states have call successors, (0), 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-11 00:01:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14075 states to 14075 states and 17898 transitions. [2024-10-11 00:01:07,978 INFO L78 Accepts]: Start accepts. Automaton has 14075 states and 17898 transitions. Word has length 600 [2024-10-11 00:01:07,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:01:07,980 INFO L471 AbstractCegarLoop]: Abstraction has 14075 states and 17898 transitions. [2024-10-11 00:01:07,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 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-11 00:01:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 14075 states and 17898 transitions. [2024-10-11 00:01:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2024-10-11 00:01:07,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:01:07,995 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:01:08,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 00:01:08,195 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-11 00:01:08,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:01:08,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:01:08,197 INFO L85 PathProgramCache]: Analyzing trace with hash -168081470, now seen corresponding path program 1 times [2024-10-11 00:01:08,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:01:08,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473125423] [2024-10-11 00:01:08,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:01:08,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:01:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:01:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:01:09,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:01:09,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473125423] [2024-10-11 00:01:09,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473125423] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:01:09,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138266560] [2024-10-11 00:01:09,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:01:09,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:01:09,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:01:09,327 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-11 00:01:09,330 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-11 00:01:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:01:09,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 00:01:09,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:01:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:01:09,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:01:09,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138266560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:01:09,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 00:01:09,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 00:01:09,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897285508] [2024-10-11 00:01:09,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:01:09,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:01:09,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:01:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:01:09,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 00:01:09,668 INFO L87 Difference]: Start difference. First operand 14075 states and 17898 transitions. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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-11 00:01:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:01:15,041 INFO L93 Difference]: Finished difference Result 36342 states and 47664 transitions. [2024-10-11 00:01:15,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:01:15,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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 602 [2024-10-11 00:01:15,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:01:15,100 INFO L225 Difference]: With dead ends: 36342 [2024-10-11 00:01:15,101 INFO L226 Difference]: Without dead ends: 24998 [2024-10-11 00:01:15,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 00:01:15,124 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 2530 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4032 mSolverCounterSat, 1472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2530 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 5504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1472 IncrementalHoareTripleChecker+Valid, 4032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:01:15,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2530 Valid, 792 Invalid, 5504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1472 Valid, 4032 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-11 00:01:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24998 states. [2024-10-11 00:01:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24998 to 23630. [2024-10-11 00:01:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23630 states, 23629 states have (on average 1.2681873968428625) internal successors, (29966), 23629 states have internal predecessors, (29966), 0 states have call successors, (0), 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-11 00:01:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23630 states to 23630 states and 29966 transitions. [2024-10-11 00:01:15,607 INFO L78 Accepts]: Start accepts. Automaton has 23630 states and 29966 transitions. Word has length 602 [2024-10-11 00:01:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:01:15,608 INFO L471 AbstractCegarLoop]: Abstraction has 23630 states and 29966 transitions. [2024-10-11 00:01:15,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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-11 00:01:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 23630 states and 29966 transitions. [2024-10-11 00:01:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2024-10-11 00:01:15,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:01:15,624 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:01:15,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 00:01:15,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:01:15,826 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:01:15,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:01:15,826 INFO L85 PathProgramCache]: Analyzing trace with hash 149161087, now seen corresponding path program 1 times [2024-10-11 00:01:15,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:01:15,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676123846] [2024-10-11 00:01:15,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:01:15,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:01:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:01:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-10-11 00:01:16,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:01:16,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676123846] [2024-10-11 00:01:16,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676123846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:01:16,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:01:16,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:01:16,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323004594] [2024-10-11 00:01:16,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:01:16,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:01:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:01:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:01:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:01:16,438 INFO L87 Difference]: Start difference. First operand 23630 states and 29966 transitions. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 0 states have call successors, (0), 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-11 00:01:21,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:01:21,590 INFO L93 Difference]: Finished difference Result 50001 states and 65071 transitions. [2024-10-11 00:01:21,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:01:21,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 0 states have call successors, (0), 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 685 [2024-10-11 00:01:21,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:01:21,656 INFO L225 Difference]: With dead ends: 50001 [2024-10-11 00:01:21,656 INFO L226 Difference]: Without dead ends: 29102 [2024-10-11 00:01:21,683 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-11 00:01:21,684 INFO L432 NwaCegarLoop]: 658 mSDtfsCounter, 1372 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 3926 mSolverCounterSat, 2117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 6043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2117 IncrementalHoareTripleChecker+Valid, 3926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-11 00:01:21,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 702 Invalid, 6043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2117 Valid, 3926 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-11 00:01:21,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29102 states. [2024-10-11 00:01:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29102 to 29093. [2024-10-11 00:01:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29093 states, 29092 states have (on average 1.25635913653238) internal successors, (36550), 29092 states have internal predecessors, (36550), 0 states have call successors, (0), 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-11 00:01:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29093 states to 29093 states and 36550 transitions. [2024-10-11 00:01:22,038 INFO L78 Accepts]: Start accepts. Automaton has 29093 states and 36550 transitions. Word has length 685 [2024-10-11 00:01:22,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:01:22,039 INFO L471 AbstractCegarLoop]: Abstraction has 29093 states and 36550 transitions. [2024-10-11 00:01:22,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 0 states have call successors, (0), 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-11 00:01:22,040 INFO L276 IsEmpty]: Start isEmpty. Operand 29093 states and 36550 transitions. [2024-10-11 00:01:22,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2024-10-11 00:01:22,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:01:22,046 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:01:22,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 00:01:22,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:01:22,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:01:22,047 INFO L85 PathProgramCache]: Analyzing trace with hash -678775175, now seen corresponding path program 1 times [2024-10-11 00:01:22,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:01:22,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958484806] [2024-10-11 00:01:22,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:01:22,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:01:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:01:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 89 proven. 218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:01:24,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:01:24,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958484806] [2024-10-11 00:01:24,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958484806] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:01:24,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340048696] [2024-10-11 00:01:24,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:01:24,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:01:24,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:01:24,725 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-11 00:01:24,726 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-11 00:01:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:01:24,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 00:01:24,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:01:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-11 00:01:25,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:01:25,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340048696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:01:25,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 00:01:25,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-11 00:01:25,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916106408] [2024-10-11 00:01:25,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:01:25,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:01:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:01:25,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:01:25,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 00:01:25,069 INFO L87 Difference]: Start difference. First operand 29093 states and 36550 transitions. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)