./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label31.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label31.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ff9f2437b71e741f48db30c539bfb90441ca24112fe46e7e8bfb68c243b80ed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:04:43,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:04:43,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:04:43,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:04:43,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:04:43,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:04:43,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:04:43,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:04:43,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:04:43,135 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:04:43,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:04:43,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:04:43,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:04:43,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:04:43,139 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:04:43,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:04:43,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:04:43,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:04:43,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:04:43,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:04:43,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:04:43,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:04:43,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:04:43,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:04:43,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:04:43,145 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:04:43,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:04:43,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:04:43,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:04:43,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:04:43,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:04:43,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:04:43,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:04:43,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:04:43,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:04:43,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:04:43,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:04:43,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:04:43,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:04:43,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:04:43,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:04:43,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:04:43,148 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ff9f2437b71e741f48db30c539bfb90441ca24112fe46e7e8bfb68c243b80ed [2024-10-12 16:04:43,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:04:43,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:04:43,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:04:43,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:04:43,411 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:04:43,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label31.c [2024-10-12 16:04:44,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:04:45,283 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:04:45,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label31.c [2024-10-12 16:04:45,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2afde3d00/901d1de2fd8d4d028e6f6cc80d06cec3/FLAG62c3ea7bb [2024-10-12 16:04:45,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2afde3d00/901d1de2fd8d4d028e6f6cc80d06cec3 [2024-10-12 16:04:45,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:04:45,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:04:45,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:04:45,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:04:45,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:04:45,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:04:45" (1/1) ... [2024-10-12 16:04:45,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@609351da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:45, skipping insertion in model container [2024-10-12 16:04:45,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:04:45" (1/1) ... [2024-10-12 16:04:45,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:04:45,819 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label31.c[7776,7789] [2024-10-12 16:04:46,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:04:46,446 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:04:46,473 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label31.c[7776,7789] [2024-10-12 16:04:46,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:04:46,913 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:04:46,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:46 WrapperNode [2024-10-12 16:04:46,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:04:46,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:04:46,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:04:46,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:04:46,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:46" (1/1) ... [2024-10-12 16:04:46,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:46" (1/1) ... [2024-10-12 16:04:47,301 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-12 16:04:47,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:04:47,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:04:47,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:04:47,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:04:47,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:46" (1/1) ... [2024-10-12 16:04:47,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:46" (1/1) ... [2024-10-12 16:04:47,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:46" (1/1) ... [2024-10-12 16:04:47,578 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-12 16:04:47,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:46" (1/1) ... [2024-10-12 16:04:47,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:46" (1/1) ... [2024-10-12 16:04:47,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:46" (1/1) ... [2024-10-12 16:04:47,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:46" (1/1) ... [2024-10-12 16:04:47,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:46" (1/1) ... [2024-10-12 16:04:47,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:46" (1/1) ... [2024-10-12 16:04:47,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:04:47,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:04:47,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:04:47,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:04:47,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:46" (1/1) ... [2024-10-12 16:04:47,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:04:47,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:04:47,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 16:04:47,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 16:04:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:04:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:04:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:04:47,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:04:48,058 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:04:48,060 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:04:52,275 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-12 16:04:52,276 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:04:52,345 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:04:52,345 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:04:52,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:04:52 BoogieIcfgContainer [2024-10-12 16:04:52,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:04:52,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:04:52,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:04:52,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:04:52,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:04:45" (1/3) ... [2024-10-12 16:04:52,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70558d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:04:52, skipping insertion in model container [2024-10-12 16:04:52,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:04:46" (2/3) ... [2024-10-12 16:04:52,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70558d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:04:52, skipping insertion in model container [2024-10-12 16:04:52,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:04:52" (3/3) ... [2024-10-12 16:04:52,356 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label31.c [2024-10-12 16:04:52,372 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:04:52,372 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:04:52,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:04:52,470 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;@75fbaa5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:04:52,471 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:04:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:04:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 16:04:52,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:04:52,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:04:52,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:04:52,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:04:52,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2115484114, now seen corresponding path program 1 times [2024-10-12 16:04:52,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:04:52,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719588713] [2024-10-12 16:04:52,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:04:52,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:04:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:04:52,731 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-12 16:04:52,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:04:52,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719588713] [2024-10-12 16:04:52,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719588713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:04:52,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:04:52,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:04:52,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215982676] [2024-10-12 16:04:52,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:04:52,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:04:52,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:04:52,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:04:52,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:04:52,773 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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-12 16:04:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:04:52,856 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-12 16:04:52,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:04:52,863 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-12 16:04:52,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:04:52,890 INFO L225 Difference]: With dead ends: 1511 [2024-10-12 16:04:52,890 INFO L226 Difference]: Without dead ends: 754 [2024-10-12 16:04:52,897 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-12 16:04:52,905 INFO L432 NwaCegarLoop]: 1438 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:04:52,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:04:52,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-12 16:04:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-12 16:04:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:04:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-12 16:04:53,007 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 62 [2024-10-12 16:04:53,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:04:53,007 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-12 16:04:53,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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-12 16:04:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-12 16:04:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 16:04:53,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:04:53,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:04:53,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:04:53,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:04:53,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:04:53,012 INFO L85 PathProgramCache]: Analyzing trace with hash 534896978, now seen corresponding path program 1 times [2024-10-12 16:04:53,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:04:53,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590713126] [2024-10-12 16:04:53,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:04:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:04:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:04:53,428 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-12 16:04:53,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:04:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590713126] [2024-10-12 16:04:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590713126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:04:53,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:04:53,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:04:53,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969839661] [2024-10-12 16:04:53,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:04:53,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:04:53,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:04:53,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:04:53,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:04:53,436 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-12 16:04:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:04:59,327 INFO L93 Difference]: Finished difference Result 3009 states and 5747 transitions. [2024-10-12 16:04:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:04:59,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-12 16:04:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:04:59,340 INFO L225 Difference]: With dead ends: 3009 [2024-10-12 16:04:59,340 INFO L226 Difference]: Without dead ends: 2256 [2024-10-12 16:04:59,342 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-12 16:04:59,343 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 2185 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5355 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 6508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:04:59,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 691 Invalid, 6508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5355 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-12 16:04:59,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2024-10-12 16:04:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2256. [2024-10-12 16:04:59,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.5751662971175167) internal successors, (3552), 2255 states have internal predecessors, (3552), 0 states have call successors, (0), 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-12 16:04:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3552 transitions. [2024-10-12 16:04:59,422 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3552 transitions. Word has length 62 [2024-10-12 16:04:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:04:59,423 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3552 transitions. [2024-10-12 16:04:59,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-12 16:04:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3552 transitions. [2024-10-12 16:04:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 16:04:59,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:04:59,428 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12 16:04:59,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:04:59,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:04:59,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:04:59,429 INFO L85 PathProgramCache]: Analyzing trace with hash 815338690, now seen corresponding path program 1 times [2024-10-12 16:04:59,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:04:59,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604860710] [2024-10-12 16:04:59,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:04:59,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:04:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:04:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:04:59,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:04:59,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604860710] [2024-10-12 16:04:59,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604860710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:04:59,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:04:59,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:04:59,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034245588] [2024-10-12 16:04:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:04:59,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:04:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:04:59,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:04:59,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:04:59,831 INFO L87 Difference]: Start difference. First operand 2256 states and 3552 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-12 16:05:03,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:05:03,589 INFO L93 Difference]: Finished difference Result 6050 states and 9915 transitions. [2024-10-12 16:05:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:05:03,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-10-12 16:05:03,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:05:03,605 INFO L225 Difference]: With dead ends: 6050 [2024-10-12 16:05:03,605 INFO L226 Difference]: Without dead ends: 3758 [2024-10-12 16:05:03,610 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-12 16:05:03,611 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 703 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3096 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 3825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:05:03,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 685 Invalid, 3825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3096 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-12 16:05:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2024-10-12 16:05:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3007. [2024-10-12 16:05:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.4321357285429142) internal successors, (4305), 3006 states have internal predecessors, (4305), 0 states have call successors, (0), 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-12 16:05:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4305 transitions. [2024-10-12 16:05:03,660 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4305 transitions. Word has length 133 [2024-10-12 16:05:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:05:03,661 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4305 transitions. [2024-10-12 16:05:03,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-12 16:05:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4305 transitions. [2024-10-12 16:05:03,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-10-12 16:05:03,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:05:03,670 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:05:03,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:05:03,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:05:03,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:05:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2061167486, now seen corresponding path program 1 times [2024-10-12 16:05:03,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:05:03,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715543865] [2024-10-12 16:05:03,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:03,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:05:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-12 16:05:03,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:05:03,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715543865] [2024-10-12 16:05:03,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715543865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:05:03,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:05:03,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:05:03,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91654362] [2024-10-12 16:05:03,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:05:03,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:05:03,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:05:03,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:05:03,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:05:03,998 INFO L87 Difference]: Start difference. First operand 3007 states and 4305 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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-12 16:05:06,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:05:06,510 INFO L93 Difference]: Finished difference Result 8266 states and 11518 transitions. [2024-10-12 16:05:06,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:05:06,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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 272 [2024-10-12 16:05:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:05:06,530 INFO L225 Difference]: With dead ends: 8266 [2024-10-12 16:05:06,530 INFO L226 Difference]: Without dead ends: 5260 [2024-10-12 16:05:06,538 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-12 16:05:06,539 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:05:06,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 425 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 16:05:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2024-10-12 16:05:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 5260. [2024-10-12 16:05:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5260 states, 5259 states have (on average 1.1983266780756798) internal successors, (6302), 5259 states have internal predecessors, (6302), 0 states have call successors, (0), 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-12 16:05:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 6302 transitions. [2024-10-12 16:05:06,620 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 6302 transitions. Word has length 272 [2024-10-12 16:05:06,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:05:06,623 INFO L471 AbstractCegarLoop]: Abstraction has 5260 states and 6302 transitions. [2024-10-12 16:05:06,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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-12 16:05:06,623 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 6302 transitions. [2024-10-12 16:05:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-12 16:05:06,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:05:06,628 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:05:06,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:05:06,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:05:06,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:05:06,629 INFO L85 PathProgramCache]: Analyzing trace with hash 194671971, now seen corresponding path program 1 times [2024-10-12 16:05:06,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:05:06,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813139674] [2024-10-12 16:05:06,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:06,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:05:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:07,189 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 16:05:07,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:05:07,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813139674] [2024-10-12 16:05:07,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813139674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:05:07,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:05:07,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:05:07,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181640547] [2024-10-12 16:05:07,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:05:07,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:05:07,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:05:07,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:05:07,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:05:07,195 INFO L87 Difference]: Start difference. First operand 5260 states and 6302 transitions. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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-12 16:05:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:05:10,173 INFO L93 Difference]: Finished difference Result 12060 states and 15067 transitions. [2024-10-12 16:05:10,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:05:10,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 274 [2024-10-12 16:05:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:05:10,197 INFO L225 Difference]: With dead ends: 12060 [2024-10-12 16:05:10,197 INFO L226 Difference]: Without dead ends: 7515 [2024-10-12 16:05:10,204 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-12 16:05:10,205 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 850 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 3962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:05:10,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 323 Invalid, 3962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3409 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 16:05:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7515 states. [2024-10-12 16:05:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7515 to 7513. [2024-10-12 16:05:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7513 states, 7512 states have (on average 1.1813099041533546) internal successors, (8874), 7512 states have internal predecessors, (8874), 0 states have call successors, (0), 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-12 16:05:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 8874 transitions. [2024-10-12 16:05:10,323 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 8874 transitions. Word has length 274 [2024-10-12 16:05:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:05:10,324 INFO L471 AbstractCegarLoop]: Abstraction has 7513 states and 8874 transitions. [2024-10-12 16:05:10,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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-12 16:05:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 8874 transitions. [2024-10-12 16:05:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-12 16:05:10,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:05:10,331 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:05:10,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:05:10,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:05:10,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:05:10,332 INFO L85 PathProgramCache]: Analyzing trace with hash -640873960, now seen corresponding path program 1 times [2024-10-12 16:05:10,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:05:10,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592300755] [2024-10-12 16:05:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:10,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:05:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-12 16:05:11,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:05:11,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592300755] [2024-10-12 16:05:11,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592300755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:05:11,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:05:11,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:05:11,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189461201] [2024-10-12 16:05:11,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:05:11,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:05:11,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:05:11,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:05:11,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:05:11,072 INFO L87 Difference]: Start difference. First operand 7513 states and 8874 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 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-12 16:05:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:05:13,835 INFO L93 Difference]: Finished difference Result 16527 states and 20145 transitions. [2024-10-12 16:05:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:05:13,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 351 [2024-10-12 16:05:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:05:13,865 INFO L225 Difference]: With dead ends: 16527 [2024-10-12 16:05:13,866 INFO L226 Difference]: Without dead ends: 9766 [2024-10-12 16:05:13,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-12 16:05:13,877 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 825 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 989 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 989 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:05:13,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 137 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [989 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 16:05:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9766 states. [2024-10-12 16:05:14,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9766 to 9766. [2024-10-12 16:05:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.207373271889401) internal successors, (11790), 9765 states have internal predecessors, (11790), 0 states have call successors, (0), 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-12 16:05:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 11790 transitions. [2024-10-12 16:05:14,102 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 11790 transitions. Word has length 351 [2024-10-12 16:05:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:05:14,103 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 11790 transitions. [2024-10-12 16:05:14,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 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-12 16:05:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 11790 transitions. [2024-10-12 16:05:14,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-10-12 16:05:14,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:05:14,117 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:05:14,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:05:14,118 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:05:14,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:05:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1142401748, now seen corresponding path program 1 times [2024-10-12 16:05:14,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:05:14,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272167830] [2024-10-12 16:05:14,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:14,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:05:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-12 16:05:14,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:05:14,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272167830] [2024-10-12 16:05:14,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272167830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:05:14,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:05:14,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:05:14,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773933111] [2024-10-12 16:05:14,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:05:14,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:05:14,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:05:14,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:05:14,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:05:14,415 INFO L87 Difference]: Start difference. First operand 9766 states and 11790 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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-12 16:05:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:05:16,625 INFO L93 Difference]: Finished difference Result 21033 states and 25743 transitions. [2024-10-12 16:05:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:05:16,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 375 [2024-10-12 16:05:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:05:16,651 INFO L225 Difference]: With dead ends: 21033 [2024-10-12 16:05:16,651 INFO L226 Difference]: Without dead ends: 12019 [2024-10-12 16:05:16,662 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-12 16:05:16,663 INFO L432 NwaCegarLoop]: 1194 mSDtfsCounter, 680 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:05:16,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1201 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 16:05:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12019 states. [2024-10-12 16:05:16,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12019 to 12019. [2024-10-12 16:05:16,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12019 states, 12018 states have (on average 1.1927109335996007) internal successors, (14334), 12018 states have internal predecessors, (14334), 0 states have call successors, (0), 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-12 16:05:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12019 states to 12019 states and 14334 transitions. [2024-10-12 16:05:16,902 INFO L78 Accepts]: Start accepts. Automaton has 12019 states and 14334 transitions. Word has length 375 [2024-10-12 16:05:16,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:05:16,902 INFO L471 AbstractCegarLoop]: Abstraction has 12019 states and 14334 transitions. [2024-10-12 16:05:16,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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-12 16:05:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand 12019 states and 14334 transitions. [2024-10-12 16:05:16,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-10-12 16:05:16,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:05:16,910 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:05:16,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:05:16,910 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:05:16,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:05:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1897117049, now seen corresponding path program 1 times [2024-10-12 16:05:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:05:16,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741534239] [2024-10-12 16:05:16,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:16,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:05:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-12 16:05:17,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:05:17,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741534239] [2024-10-12 16:05:17,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741534239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:05:17,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:05:17,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:05:17,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786699320] [2024-10-12 16:05:17,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:05:17,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:05:17,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:05:17,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:05:17,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:05:17,216 INFO L87 Difference]: Start difference. First operand 12019 states and 14334 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-12 16:05:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:05:19,849 INFO L93 Difference]: Finished difference Result 33800 states and 40732 transitions. [2024-10-12 16:05:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:05:19,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 389 [2024-10-12 16:05:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:05:19,890 INFO L225 Difference]: With dead ends: 33800 [2024-10-12 16:05:19,890 INFO L226 Difference]: Without dead ends: 22533 [2024-10-12 16:05:19,901 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-12 16:05:19,903 INFO L432 NwaCegarLoop]: 1256 mSDtfsCounter, 636 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:05:19,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1262 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 16:05:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22533 states. [2024-10-12 16:05:20,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22533 to 21782. [2024-10-12 16:05:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21782 states, 21781 states have (on average 1.1792387860979754) internal successors, (25685), 21781 states have internal predecessors, (25685), 0 states have call successors, (0), 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-12 16:05:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21782 states to 21782 states and 25685 transitions. [2024-10-12 16:05:20,269 INFO L78 Accepts]: Start accepts. Automaton has 21782 states and 25685 transitions. Word has length 389 [2024-10-12 16:05:20,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:05:20,270 INFO L471 AbstractCegarLoop]: Abstraction has 21782 states and 25685 transitions. [2024-10-12 16:05:20,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-12 16:05:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 21782 states and 25685 transitions. [2024-10-12 16:05:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-12 16:05:20,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:05:20,280 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:05:20,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:05:20,280 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:05:20,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:05:20,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1638091624, now seen corresponding path program 1 times [2024-10-12 16:05:20,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:05:20,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139335040] [2024-10-12 16:05:20,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:20,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:05:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 83 proven. 99 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-12 16:05:20,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:05:20,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139335040] [2024-10-12 16:05:20,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139335040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:05:20,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741819455] [2024-10-12 16:05:20,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:20,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:05:20,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:05:20,947 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:05:20,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 16:05:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:21,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:05:21,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:05:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-12 16:05:21,270 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:05:21,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741819455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:05:21,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:05:21,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-12 16:05:21,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457188704] [2024-10-12 16:05:21,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:05:21,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:05:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:05:21,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:05:21,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-12 16:05:21,275 INFO L87 Difference]: Start difference. First operand 21782 states and 25685 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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-12 16:05:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:05:23,976 INFO L93 Difference]: Finished difference Result 51073 states and 61071 transitions. [2024-10-12 16:05:23,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:05:23,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 390 [2024-10-12 16:05:23,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:05:24,034 INFO L225 Difference]: With dead ends: 51073 [2024-10-12 16:05:24,035 INFO L226 Difference]: Without dead ends: 30043 [2024-10-12 16:05:24,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-12 16:05:24,060 INFO L432 NwaCegarLoop]: 1313 mSDtfsCounter, 700 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2470 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 2470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:05:24,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1320 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 2470 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 16:05:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30043 states. [2024-10-12 16:05:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30043 to 29292. [2024-10-12 16:05:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29292 states, 29291 states have (on average 1.1817281758902052) internal successors, (34614), 29291 states have internal predecessors, (34614), 0 states have call successors, (0), 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-12 16:05:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29292 states to 29292 states and 34614 transitions. [2024-10-12 16:05:24,440 INFO L78 Accepts]: Start accepts. Automaton has 29292 states and 34614 transitions. Word has length 390 [2024-10-12 16:05:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:05:24,440 INFO L471 AbstractCegarLoop]: Abstraction has 29292 states and 34614 transitions. [2024-10-12 16:05:24,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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-12 16:05:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 29292 states and 34614 transitions. [2024-10-12 16:05:24,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-10-12 16:05:24,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:05:24,446 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:05:24,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 16:05:24,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:05:24,650 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:05:24,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:05:24,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1592853181, now seen corresponding path program 1 times [2024-10-12 16:05:24,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:05:24,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503038766] [2024-10-12 16:05:24,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:24,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:05:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-12 16:05:24,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:05:24,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503038766] [2024-10-12 16:05:24,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503038766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:05:24,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:05:24,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:05:24,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884265773] [2024-10-12 16:05:24,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:05:24,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:05:24,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:05:24,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:05:24,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:05:24,960 INFO L87 Difference]: Start difference. First operand 29292 states and 34614 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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-12 16:05:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:05:27,624 INFO L93 Difference]: Finished difference Result 83366 states and 99186 transitions. [2024-10-12 16:05:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:05:27,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 393 [2024-10-12 16:05:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:05:27,691 INFO L225 Difference]: With dead ends: 83366 [2024-10-12 16:05:27,691 INFO L226 Difference]: Without dead ends: 50320 [2024-10-12 16:05:27,722 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-12 16:05:27,723 INFO L432 NwaCegarLoop]: 1306 mSDtfsCounter, 722 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2224 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 2224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:05:27,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1313 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 2224 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 16:05:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50320 states. [2024-10-12 16:05:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50320 to 49569. [2024-10-12 16:05:28,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49569 states, 49568 states have (on average 1.138234344738541) internal successors, (56420), 49568 states have internal predecessors, (56420), 0 states have call successors, (0), 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-12 16:05:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49569 states to 49569 states and 56420 transitions. [2024-10-12 16:05:28,455 INFO L78 Accepts]: Start accepts. Automaton has 49569 states and 56420 transitions. Word has length 393 [2024-10-12 16:05:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:05:28,457 INFO L471 AbstractCegarLoop]: Abstraction has 49569 states and 56420 transitions. [2024-10-12 16:05:28,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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-12 16:05:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 49569 states and 56420 transitions. [2024-10-12 16:05:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2024-10-12 16:05:28,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:05:28,465 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:05:28,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:05:28,465 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:05:28,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:05:28,466 INFO L85 PathProgramCache]: Analyzing trace with hash -84651708, now seen corresponding path program 1 times [2024-10-12 16:05:28,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:05:28,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115045159] [2024-10-12 16:05:28,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:28,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:05:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-12 16:05:28,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:05:28,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115045159] [2024-10-12 16:05:28,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115045159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:05:28,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:05:28,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:05:28,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076997069] [2024-10-12 16:05:28,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:05:28,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:05:28,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:05:28,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:05:28,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:05:28,971 INFO L87 Difference]: Start difference. First operand 49569 states and 56420 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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-12 16:05:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:05:31,677 INFO L93 Difference]: Finished difference Result 98386 states and 112083 transitions. [2024-10-12 16:05:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:05:31,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 422 [2024-10-12 16:05:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:05:31,740 INFO L225 Difference]: With dead ends: 98386 [2024-10-12 16:05:31,740 INFO L226 Difference]: Without dead ends: 49569 [2024-10-12 16:05:31,770 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-12 16:05:31,771 INFO L432 NwaCegarLoop]: 1252 mSDtfsCounter, 669 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 2644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:05:31,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1259 Invalid, 2644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 16:05:31,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49569 states. [2024-10-12 16:05:32,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49569 to 48067. [2024-10-12 16:05:32,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48067 states, 48066 states have (on average 1.100486830607914) internal successors, (52896), 48066 states have internal predecessors, (52896), 0 states have call successors, (0), 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-12 16:05:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48067 states to 48067 states and 52896 transitions. [2024-10-12 16:05:32,329 INFO L78 Accepts]: Start accepts. Automaton has 48067 states and 52896 transitions. Word has length 422 [2024-10-12 16:05:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:05:32,330 INFO L471 AbstractCegarLoop]: Abstraction has 48067 states and 52896 transitions. [2024-10-12 16:05:32,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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-12 16:05:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 48067 states and 52896 transitions. [2024-10-12 16:05:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2024-10-12 16:05:32,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:05:32,340 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:05:32,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:05:32,340 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:05:32,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:05:32,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1549593847, now seen corresponding path program 1 times [2024-10-12 16:05:32,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:05:32,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94004042] [2024-10-12 16:05:32,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:32,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:05:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-12 16:05:32,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:05:32,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94004042] [2024-10-12 16:05:32,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94004042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:05:32,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:05:32,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:05:32,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485730680] [2024-10-12 16:05:32,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:05:32,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:05:32,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:05:32,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:05:32,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:05:32,867 INFO L87 Difference]: Start difference. First operand 48067 states and 52896 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-12 16:05:35,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:05:35,734 INFO L93 Difference]: Finished difference Result 95382 states and 105035 transitions. [2024-10-12 16:05:35,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:05:35,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 456 [2024-10-12 16:05:35,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:05:35,783 INFO L225 Difference]: With dead ends: 95382 [2024-10-12 16:05:35,783 INFO L226 Difference]: Without dead ends: 48067 [2024-10-12 16:05:35,808 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-12 16:05:35,809 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 683 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2434 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:05:35,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 297 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2434 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 16:05:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48067 states. [2024-10-12 16:05:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48067 to 48067. [2024-10-12 16:05:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48067 states, 48066 states have (on average 1.0971372695876502) internal successors, (52735), 48066 states have internal predecessors, (52735), 0 states have call successors, (0), 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-12 16:05:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48067 states to 48067 states and 52735 transitions. [2024-10-12 16:05:36,278 INFO L78 Accepts]: Start accepts. Automaton has 48067 states and 52735 transitions. Word has length 456 [2024-10-12 16:05:36,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:05:36,278 INFO L471 AbstractCegarLoop]: Abstraction has 48067 states and 52735 transitions. [2024-10-12 16:05:36,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-12 16:05:36,278 INFO L276 IsEmpty]: Start isEmpty. Operand 48067 states and 52735 transitions. [2024-10-12 16:05:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2024-10-12 16:05:36,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:05:36,287 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-10-12 16:05:36,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:05:36,288 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:05:36,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:05:36,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2121547722, now seen corresponding path program 1 times [2024-10-12 16:05:36,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:05:36,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587236764] [2024-10-12 16:05:36,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:36,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:05:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-10-12 16:05:36,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:05:36,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587236764] [2024-10-12 16:05:36,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587236764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:05:36,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:05:36,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:05:36,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360204573] [2024-10-12 16:05:36,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:05:36,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:05:36,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:05:36,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:05:36,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:05:36,642 INFO L87 Difference]: Start difference. First operand 48067 states and 52735 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-12 16:05:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:05:39,393 INFO L93 Difference]: Finished difference Result 97635 states and 107043 transitions. [2024-10-12 16:05:39,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:05:39,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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 461 [2024-10-12 16:05:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:05:39,438 INFO L225 Difference]: With dead ends: 97635 [2024-10-12 16:05:39,438 INFO L226 Difference]: Without dead ends: 50320 [2024-10-12 16:05:39,461 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-12 16:05:39,462 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 704 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:05:39,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 215 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 16:05:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50320 states. [2024-10-12 16:05:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50320 to 46565. [2024-10-12 16:05:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46565 states, 46564 states have (on average 1.095009019843656) internal successors, (50988), 46564 states have internal predecessors, (50988), 0 states have call successors, (0), 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-12 16:05:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46565 states to 46565 states and 50988 transitions. [2024-10-12 16:05:40,034 INFO L78 Accepts]: Start accepts. Automaton has 46565 states and 50988 transitions. Word has length 461 [2024-10-12 16:05:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:05:40,034 INFO L471 AbstractCegarLoop]: Abstraction has 46565 states and 50988 transitions. [2024-10-12 16:05:40,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-12 16:05:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 46565 states and 50988 transitions. [2024-10-12 16:05:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-10-12 16:05:40,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:05:40,050 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:05:40,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 16:05:40,050 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:05:40,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:05:40,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1132486164, now seen corresponding path program 1 times [2024-10-12 16:05:40,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:05:40,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004709505] [2024-10-12 16:05:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:40,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:05:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-12 16:05:40,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:05:40,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004709505] [2024-10-12 16:05:40,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004709505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:05:40,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:05:40,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:05:40,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173756472] [2024-10-12 16:05:40,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:05:40,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:05:40,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:05:40,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:05:40,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:05:40,486 INFO L87 Difference]: Start difference. First operand 46565 states and 50988 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-12 16:05:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:05:43,235 INFO L93 Difference]: Finished difference Result 114908 states and 127019 transitions. [2024-10-12 16:05:43,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:05:43,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 472 [2024-10-12 16:05:43,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:05:43,427 INFO L225 Difference]: With dead ends: 114908 [2024-10-12 16:05:43,427 INFO L226 Difference]: Without dead ends: 69095 [2024-10-12 16:05:43,451 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-12 16:05:43,452 INFO L432 NwaCegarLoop]: 1249 mSDtfsCounter, 710 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 676 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 676 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:05:43,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1256 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [676 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 16:05:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69095 states. [2024-10-12 16:05:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69095 to 66091. [2024-10-12 16:05:43,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66091 states, 66090 states have (on average 1.0850355575730064) internal successors, (71710), 66090 states have internal predecessors, (71710), 0 states have call successors, (0), 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-12 16:05:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66091 states to 66091 states and 71710 transitions. [2024-10-12 16:05:44,053 INFO L78 Accepts]: Start accepts. Automaton has 66091 states and 71710 transitions. Word has length 472 [2024-10-12 16:05:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:05:44,054 INFO L471 AbstractCegarLoop]: Abstraction has 66091 states and 71710 transitions. [2024-10-12 16:05:44,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-12 16:05:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 66091 states and 71710 transitions. [2024-10-12 16:05:44,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2024-10-12 16:05:44,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:05:44,064 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:05:44,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:05:44,065 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:05:44,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:05:44,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1773092031, now seen corresponding path program 1 times [2024-10-12 16:05:44,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:05:44,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674033054] [2024-10-12 16:05:44,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:44,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:05:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-10-12 16:05:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:05:44,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674033054] [2024-10-12 16:05:44,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674033054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:05:44,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:05:44,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:05:44,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769236206] [2024-10-12 16:05:44,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:05:44,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:05:44,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:05:44,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:05:44,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:05:44,475 INFO L87 Difference]: Start difference. First operand 66091 states and 71710 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-12 16:05:47,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:05:47,371 INFO L93 Difference]: Finished difference Result 177241 states and 192751 transitions. [2024-10-12 16:05:47,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:05:47,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 499 [2024-10-12 16:05:47,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:05:47,488 INFO L225 Difference]: With dead ends: 177241 [2024-10-12 16:05:47,488 INFO L226 Difference]: Without dead ends: 111902 [2024-10-12 16:05:47,529 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-12 16:05:47,530 INFO L432 NwaCegarLoop]: 1242 mSDtfsCounter, 663 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:05:47,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1249 Invalid, 2791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 16:05:47,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111902 states. [2024-10-12 16:05:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111902 to 101388. [2024-10-12 16:05:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101388 states, 101387 states have (on average 1.072326826910748) internal successors, (108720), 101387 states have internal predecessors, (108720), 0 states have call successors, (0), 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-12 16:05:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101388 states to 101388 states and 108720 transitions. [2024-10-12 16:05:49,016 INFO L78 Accepts]: Start accepts. Automaton has 101388 states and 108720 transitions. Word has length 499 [2024-10-12 16:05:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:05:49,017 INFO L471 AbstractCegarLoop]: Abstraction has 101388 states and 108720 transitions. [2024-10-12 16:05:49,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-12 16:05:49,018 INFO L276 IsEmpty]: Start isEmpty. Operand 101388 states and 108720 transitions. [2024-10-12 16:05:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2024-10-12 16:05:49,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:05:49,049 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:05:49,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:05:49,050 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:05:49,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:05:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash 429411364, now seen corresponding path program 1 times [2024-10-12 16:05:49,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:05:49,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104700146] [2024-10-12 16:05:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:05:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-12 16:05:49,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:05:49,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104700146] [2024-10-12 16:05:49,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104700146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:05:49,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:05:49,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:05:49,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843327800] [2024-10-12 16:05:49,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:05:49,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:05:49,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:05:49,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:05:49,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:05:49,370 INFO L87 Difference]: Start difference. First operand 101388 states and 108720 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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-12 16:05:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:05:52,211 INFO L93 Difference]: Finished difference Result 218546 states and 234635 transitions. [2024-10-12 16:05:52,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:05:52,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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 553 [2024-10-12 16:05:52,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:05:52,344 INFO L225 Difference]: With dead ends: 218546 [2024-10-12 16:05:52,344 INFO L226 Difference]: Without dead ends: 117910 [2024-10-12 16:05:52,398 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-12 16:05:52,398 INFO L432 NwaCegarLoop]: 1107 mSDtfsCounter, 811 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:05:52,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1114 Invalid, 2557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 16:05:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117910 states. [2024-10-12 16:05:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117910 to 117159. [2024-10-12 16:05:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117159 states, 117158 states have (on average 1.068300926953345) internal successors, (125160), 117158 states have internal predecessors, (125160), 0 states have call successors, (0), 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-12 16:05:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117159 states to 117159 states and 125160 transitions. [2024-10-12 16:05:53,864 INFO L78 Accepts]: Start accepts. Automaton has 117159 states and 125160 transitions. Word has length 553 [2024-10-12 16:05:53,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:05:53,864 INFO L471 AbstractCegarLoop]: Abstraction has 117159 states and 125160 transitions. [2024-10-12 16:05:53,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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-12 16:05:53,865 INFO L276 IsEmpty]: Start isEmpty. Operand 117159 states and 125160 transitions. [2024-10-12 16:05:53,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2024-10-12 16:05:53,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:05:53,905 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:05:53,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 16:05:53,905 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:05:53,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:05:53,906 INFO L85 PathProgramCache]: Analyzing trace with hash 547904453, now seen corresponding path program 1 times [2024-10-12 16:05:53,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:05:53,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137165855] [2024-10-12 16:05:53,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:53,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:05:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 610 proven. 108 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-12 16:05:55,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:05:55,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137165855] [2024-10-12 16:05:55,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137165855] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:05:55,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660737091] [2024-10-12 16:05:55,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:05:55,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:05:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:05:55,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:05:55,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 16:05:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:05:55,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 16:05:55,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:05:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 720 proven. 108 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-12 16:05:56,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:05:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 720 proven. 108 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-12 16:05:57,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660737091] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 16:05:57,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 16:05:57,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 5 [2024-10-12 16:05:57,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340097411] [2024-10-12 16:05:57,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 16:05:57,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 16:05:57,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:05:57,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 16:05:57,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:05:57,955 INFO L87 Difference]: Start difference. First operand 117159 states and 125160 transitions. Second operand has 6 states, 6 states have (on average 137.33333333333334) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)