./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.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/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.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 d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:03:44,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:03:44,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:03:44,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:03:44,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:03:44,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:03:44,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:03:44,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:03:44,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:03:44,494 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:03:44,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:03:44,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:03:44,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:03:44,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:03:44,496 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:03:44,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:03:44,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:03:44,497 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:03:44,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:03:44,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:03:44,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:03:44,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:03:44,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:03:44,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:03:44,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:03:44,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:03:44,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:03:44,500 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:03:44,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:03:44,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:03:44,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:03:44,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:03:44,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:03:44,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:03:44,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:03:44,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:03:44,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:03:44,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:03:44,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:03:44,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:03:44,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:03:44,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:03:44,505 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 -> d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 [2024-10-12 20:03:44,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:03:44,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:03:44,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:03:44,769 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:03:44,769 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:03:44,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2024-10-12 20:03:46,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:03:46,428 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:03:46,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2024-10-12 20:03:46,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0a121c6/7a1cea241115493a975a794603de56cf/FLAG84515b640 [2024-10-12 20:03:46,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0a121c6/7a1cea241115493a975a794603de56cf [2024-10-12 20:03:46,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:03:46,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:03:46,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:03:46,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:03:46,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:03:46,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:03:46" (1/1) ... [2024-10-12 20:03:46,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f97ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:46, skipping insertion in model container [2024-10-12 20:03:46,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:03:46" (1/1) ... [2024-10-12 20:03:46,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:03:47,038 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/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2024-10-12 20:03:47,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:03:47,051 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:03:47,088 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/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2024-10-12 20:03:47,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:03:47,103 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:03:47,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:47 WrapperNode [2024-10-12 20:03:47,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:03:47,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:03:47,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:03:47,105 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:03:47,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:47" (1/1) ... [2024-10-12 20:03:47,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:47" (1/1) ... [2024-10-12 20:03:47,163 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2024-10-12 20:03:47,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:03:47,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:03:47,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:03:47,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:03:47,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:47" (1/1) ... [2024-10-12 20:03:47,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:47" (1/1) ... [2024-10-12 20:03:47,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:47" (1/1) ... [2024-10-12 20:03:47,227 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 20:03:47,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:47" (1/1) ... [2024-10-12 20:03:47,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:47" (1/1) ... [2024-10-12 20:03:47,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:47" (1/1) ... [2024-10-12 20:03:47,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:47" (1/1) ... [2024-10-12 20:03:47,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:47" (1/1) ... [2024-10-12 20:03:47,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:47" (1/1) ... [2024-10-12 20:03:47,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:03:47,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:03:47,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:03:47,241 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:03:47,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:47" (1/1) ... [2024-10-12 20:03:47,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:03:47,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:03:47,280 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 20:03:47,287 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 20:03:47,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:03:47,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:03:47,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:03:47,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:03:47,427 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:03:47,431 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:03:47,775 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-12 20:03:47,775 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:03:47,816 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:03:47,816 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 20:03:47,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:03:47 BoogieIcfgContainer [2024-10-12 20:03:47,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:03:47,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:03:47,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:03:47,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:03:47,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:03:46" (1/3) ... [2024-10-12 20:03:47,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e4a44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:03:47, skipping insertion in model container [2024-10-12 20:03:47,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:47" (2/3) ... [2024-10-12 20:03:47,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e4a44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:03:47, skipping insertion in model container [2024-10-12 20:03:47,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:03:47" (3/3) ... [2024-10-12 20:03:47,830 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2024-10-12 20:03:47,848 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:03:47,849 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:03:47,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:03:47,930 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;@5e37eca1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:03:47,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:03:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 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 20:03:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 20:03:47,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:47,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:03:47,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:47,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash -417268953, now seen corresponding path program 1 times [2024-10-12 20:03:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:47,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027392030] [2024-10-12 20:03:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:47,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:48,203 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 20:03:48,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:48,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027392030] [2024-10-12 20:03:48,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027392030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:48,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:48,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 20:03:48,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673880165] [2024-10-12 20:03:48,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:48,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 20:03:48,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:48,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 20:03:48,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:03:48,229 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:03:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:48,257 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2024-10-12 20:03:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 20:03:48,259 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-12 20:03:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:48,266 INFO L225 Difference]: With dead ends: 83 [2024-10-12 20:03:48,266 INFO L226 Difference]: Without dead ends: 49 [2024-10-12 20:03:48,268 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 20:03:48,271 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:48,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-12 20:03:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-12 20:03:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 48 states have internal predecessors, (82), 0 states have call successors, (0), 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 20:03:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions. [2024-10-12 20:03:48,309 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 16 [2024-10-12 20:03:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:48,310 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 82 transitions. [2024-10-12 20:03:48,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:03:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions. [2024-10-12 20:03:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 20:03:48,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:48,311 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:03:48,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:03:48,312 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:48,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:48,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1004074967, now seen corresponding path program 1 times [2024-10-12 20:03:48,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:48,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167165538] [2024-10-12 20:03:48,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:48,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:48,499 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 20:03:48,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:48,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167165538] [2024-10-12 20:03:48,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167165538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:48,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:48,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:03:48,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703153108] [2024-10-12 20:03:48,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:48,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:03:48,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:48,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:03:48,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:03:48,505 INFO L87 Difference]: Start difference. First operand 49 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:03:48,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:48,575 INFO L93 Difference]: Finished difference Result 110 states and 177 transitions. [2024-10-12 20:03:48,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:03:48,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-12 20:03:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:48,578 INFO L225 Difference]: With dead ends: 110 [2024-10-12 20:03:48,578 INFO L226 Difference]: Without dead ends: 78 [2024-10-12 20:03:48,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:03:48,579 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 45 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:48,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 212 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:03:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-12 20:03:48,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2024-10-12 20:03:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 0 states have call successors, (0), 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 20:03:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2024-10-12 20:03:48,590 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 16 [2024-10-12 20:03:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:48,590 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2024-10-12 20:03:48,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:03:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2024-10-12 20:03:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 20:03:48,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:48,592 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] [2024-10-12 20:03:48,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:03:48,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:48,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:48,598 INFO L85 PathProgramCache]: Analyzing trace with hash 871528204, now seen corresponding path program 1 times [2024-10-12 20:03:48,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:48,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227707984] [2024-10-12 20:03:48,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:48,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:48,804 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 20:03:48,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:48,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227707984] [2024-10-12 20:03:48,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227707984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:48,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:48,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:03:48,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222480163] [2024-10-12 20:03:48,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:48,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:03:48,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:48,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:03:48,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:03:48,808 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 20:03:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:48,966 INFO L93 Difference]: Finished difference Result 223 states and 342 transitions. [2024-10-12 20:03:48,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:03:48,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-10-12 20:03:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:48,969 INFO L225 Difference]: With dead ends: 223 [2024-10-12 20:03:48,971 INFO L226 Difference]: Without dead ends: 194 [2024-10-12 20:03:48,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:03:48,972 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 264 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:48,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 402 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:03:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-12 20:03:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 76. [2024-10-12 20:03:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 75 states have internal predecessors, (109), 0 states have call successors, (0), 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 20:03:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 109 transitions. [2024-10-12 20:03:48,989 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 109 transitions. Word has length 31 [2024-10-12 20:03:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:48,990 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 109 transitions. [2024-10-12 20:03:48,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 20:03:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2024-10-12 20:03:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 20:03:48,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:48,991 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] [2024-10-12 20:03:48,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:03:48,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:48,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:48,992 INFO L85 PathProgramCache]: Analyzing trace with hash -739726020, now seen corresponding path program 1 times [2024-10-12 20:03:48,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:48,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023001342] [2024-10-12 20:03:48,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:48,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:49,091 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 20:03:49,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:49,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023001342] [2024-10-12 20:03:49,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023001342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:49,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:49,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:03:49,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200529619] [2024-10-12 20:03:49,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:49,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:03:49,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:49,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:03:49,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:49,095 INFO L87 Difference]: Start difference. First operand 76 states and 109 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 20:03:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:49,125 INFO L93 Difference]: Finished difference Result 177 states and 268 transitions. [2024-10-12 20:03:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:03:49,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-12 20:03:49,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:49,128 INFO L225 Difference]: With dead ends: 177 [2024-10-12 20:03:49,130 INFO L226 Difference]: Without dead ends: 121 [2024-10-12 20:03:49,131 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 20:03:49,132 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:49,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 101 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:49,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-12 20:03:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-10-12 20:03:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 118 states have internal predecessors, (175), 0 states have call successors, (0), 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 20:03:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2024-10-12 20:03:49,149 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 33 [2024-10-12 20:03:49,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:49,150 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2024-10-12 20:03:49,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 20:03:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2024-10-12 20:03:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 20:03:49,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:49,152 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] [2024-10-12 20:03:49,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:03:49,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:49,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:49,153 INFO L85 PathProgramCache]: Analyzing trace with hash -737581068, now seen corresponding path program 1 times [2024-10-12 20:03:49,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:49,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608934162] [2024-10-12 20:03:49,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:49,378 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 20:03:49,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:49,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608934162] [2024-10-12 20:03:49,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608934162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:49,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:49,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:03:49,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595833651] [2024-10-12 20:03:49,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:49,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:03:49,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:49,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:03:49,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:03:49,384 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 20:03:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:49,466 INFO L93 Difference]: Finished difference Result 220 states and 331 transitions. [2024-10-12 20:03:49,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:03:49,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-12 20:03:49,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:49,469 INFO L225 Difference]: With dead ends: 220 [2024-10-12 20:03:49,469 INFO L226 Difference]: Without dead ends: 121 [2024-10-12 20:03:49,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:03:49,471 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 35 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:49,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 181 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:49,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-12 20:03:49,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-10-12 20:03:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 0 states have call successors, (0), 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 20:03:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2024-10-12 20:03:49,489 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 33 [2024-10-12 20:03:49,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:49,489 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2024-10-12 20:03:49,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 20:03:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2024-10-12 20:03:49,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 20:03:49,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:49,491 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] [2024-10-12 20:03:49,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:03:49,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:49,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:49,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1404220512, now seen corresponding path program 1 times [2024-10-12 20:03:49,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:49,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385618912] [2024-10-12 20:03:49,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:49,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:49,630 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 20:03:49,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:49,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385618912] [2024-10-12 20:03:49,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385618912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:49,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:49,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:03:49,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334835489] [2024-10-12 20:03:49,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:49,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:03:49,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:49,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:03:49,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:03:49,633 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 20:03:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:49,656 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2024-10-12 20:03:49,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:03:49,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-12 20:03:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:49,658 INFO L225 Difference]: With dead ends: 125 [2024-10-12 20:03:49,658 INFO L226 Difference]: Without dead ends: 123 [2024-10-12 20:03:49,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:03:49,659 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:49,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:49,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-12 20:03:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-12 20:03:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.4426229508196722) internal successors, (176), 122 states have internal predecessors, (176), 0 states have call successors, (0), 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 20:03:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2024-10-12 20:03:49,666 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 34 [2024-10-12 20:03:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:49,667 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2024-10-12 20:03:49,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 20:03:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2024-10-12 20:03:49,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 20:03:49,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:49,672 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] [2024-10-12 20:03:49,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:03:49,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:49,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:49,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1768252524, now seen corresponding path program 1 times [2024-10-12 20:03:49,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:49,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211145399] [2024-10-12 20:03:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:49,723 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 20:03:49,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:49,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211145399] [2024-10-12 20:03:49,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211145399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:49,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:49,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:03:49,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961857203] [2024-10-12 20:03:49,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:49,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:03:49,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:49,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:03:49,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:49,726 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 20:03:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:49,744 INFO L93 Difference]: Finished difference Result 237 states and 349 transitions. [2024-10-12 20:03:49,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:03:49,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-12 20:03:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:49,747 INFO L225 Difference]: With dead ends: 237 [2024-10-12 20:03:49,747 INFO L226 Difference]: Without dead ends: 177 [2024-10-12 20:03:49,747 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 20:03:49,748 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:49,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 139 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-12 20:03:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2024-10-12 20:03:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.4540229885057472) internal successors, (253), 174 states have internal predecessors, (253), 0 states have call successors, (0), 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 20:03:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2024-10-12 20:03:49,771 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 35 [2024-10-12 20:03:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:49,772 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2024-10-12 20:03:49,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 20:03:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2024-10-12 20:03:49,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 20:03:49,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:49,773 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] [2024-10-12 20:03:49,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:03:49,773 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:49,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1901058708, now seen corresponding path program 1 times [2024-10-12 20:03:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:49,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531328779] [2024-10-12 20:03:49,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:49,823 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 20:03:49,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:49,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531328779] [2024-10-12 20:03:49,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531328779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:49,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:49,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:03:49,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967883929] [2024-10-12 20:03:49,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:49,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:03:49,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:49,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:03:49,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:49,826 INFO L87 Difference]: Start difference. First operand 175 states and 253 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 20:03:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:49,854 INFO L93 Difference]: Finished difference Result 457 states and 673 transitions. [2024-10-12 20:03:49,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:03:49,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-12 20:03:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:49,856 INFO L225 Difference]: With dead ends: 457 [2024-10-12 20:03:49,856 INFO L226 Difference]: Without dead ends: 304 [2024-10-12 20:03:49,858 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 20:03:49,859 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 34 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:49,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-12 20:03:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2024-10-12 20:03:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.4451827242524917) internal successors, (435), 301 states have internal predecessors, (435), 0 states have call successors, (0), 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 20:03:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 435 transitions. [2024-10-12 20:03:49,879 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 435 transitions. Word has length 35 [2024-10-12 20:03:49,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:49,880 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 435 transitions. [2024-10-12 20:03:49,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 20:03:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 435 transitions. [2024-10-12 20:03:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 20:03:49,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:49,881 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] [2024-10-12 20:03:49,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:03:49,881 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:49,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1505175148, now seen corresponding path program 1 times [2024-10-12 20:03:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:49,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514870665] [2024-10-12 20:03:49,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:49,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:49,929 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 20:03:49,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:49,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514870665] [2024-10-12 20:03:49,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514870665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:49,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:49,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:03:49,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592158513] [2024-10-12 20:03:49,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:49,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:03:49,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:49,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:03:49,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:49,932 INFO L87 Difference]: Start difference. First operand 302 states and 435 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 20:03:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:49,957 INFO L93 Difference]: Finished difference Result 814 states and 1177 transitions. [2024-10-12 20:03:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:03:49,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-12 20:03:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:49,960 INFO L225 Difference]: With dead ends: 814 [2024-10-12 20:03:49,960 INFO L226 Difference]: Without dead ends: 534 [2024-10-12 20:03:49,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:49,962 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 32 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:49,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 147 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:49,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-10-12 20:03:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 532. [2024-10-12 20:03:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 1.4143126177024483) internal successors, (751), 531 states have internal predecessors, (751), 0 states have call successors, (0), 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 20:03:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 751 transitions. [2024-10-12 20:03:49,980 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 751 transitions. Word has length 35 [2024-10-12 20:03:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:49,980 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 751 transitions. [2024-10-12 20:03:49,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 20:03:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 751 transitions. [2024-10-12 20:03:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:03:49,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:49,985 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:03:49,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:03:49,985 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:49,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:49,986 INFO L85 PathProgramCache]: Analyzing trace with hash -217205247, now seen corresponding path program 1 times [2024-10-12 20:03:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:49,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165672963] [2024-10-12 20:03:49,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:49,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:03:50,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:50,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165672963] [2024-10-12 20:03:50,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165672963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:50,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:50,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:03:50,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979556826] [2024-10-12 20:03:50,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:50,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:03:50,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:50,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:03:50,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:03:50,132 INFO L87 Difference]: Start difference. First operand 532 states and 751 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 20:03:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:50,250 INFO L93 Difference]: Finished difference Result 2040 states and 2903 transitions. [2024-10-12 20:03:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:03:50,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 49 [2024-10-12 20:03:50,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:50,258 INFO L225 Difference]: With dead ends: 2040 [2024-10-12 20:03:50,258 INFO L226 Difference]: Without dead ends: 1670 [2024-10-12 20:03:50,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:03:50,261 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 155 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:50,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 276 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:03:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2024-10-12 20:03:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 972. [2024-10-12 20:03:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.411946446961895) internal successors, (1371), 971 states have internal predecessors, (1371), 0 states have call successors, (0), 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 20:03:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1371 transitions. [2024-10-12 20:03:50,312 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1371 transitions. Word has length 49 [2024-10-12 20:03:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:50,312 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1371 transitions. [2024-10-12 20:03:50,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 20:03:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1371 transitions. [2024-10-12 20:03:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:03:50,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:50,314 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:03:50,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:03:50,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:50,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash -842861311, now seen corresponding path program 1 times [2024-10-12 20:03:50,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:50,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872535337] [2024-10-12 20:03:50,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 20:03:50,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:50,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872535337] [2024-10-12 20:03:50,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872535337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:50,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:50,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:03:50,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763181097] [2024-10-12 20:03:50,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:50,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:03:50,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:50,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:03:50,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:03:50,419 INFO L87 Difference]: Start difference. First operand 972 states and 1371 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:03:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:50,520 INFO L93 Difference]: Finished difference Result 2548 states and 3623 transitions. [2024-10-12 20:03:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:03:50,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-12 20:03:50,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:50,528 INFO L225 Difference]: With dead ends: 2548 [2024-10-12 20:03:50,528 INFO L226 Difference]: Without dead ends: 2038 [2024-10-12 20:03:50,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:03:50,530 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 159 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:50,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 253 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2024-10-12 20:03:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1664. [2024-10-12 20:03:50,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1663 states have (on average 1.4088995790739627) internal successors, (2343), 1663 states have internal predecessors, (2343), 0 states have call successors, (0), 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 20:03:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2343 transitions. [2024-10-12 20:03:50,586 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2343 transitions. Word has length 49 [2024-10-12 20:03:50,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:50,586 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2343 transitions. [2024-10-12 20:03:50,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:03:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2343 transitions. [2024-10-12 20:03:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:03:50,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:50,587 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:03:50,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:03:50,588 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:50,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:50,588 INFO L85 PathProgramCache]: Analyzing trace with hash 45872129, now seen corresponding path program 1 times [2024-10-12 20:03:50,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:50,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74873603] [2024-10-12 20:03:50,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:50,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:03:50,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:50,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74873603] [2024-10-12 20:03:50,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74873603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:50,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:50,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:03:50,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552829669] [2024-10-12 20:03:50,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:50,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:03:50,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:50,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:03:50,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:03:50,691 INFO L87 Difference]: Start difference. First operand 1664 states and 2343 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 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 20:03:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:50,809 INFO L93 Difference]: Finished difference Result 3056 states and 4339 transitions. [2024-10-12 20:03:50,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:03:50,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 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 49 [2024-10-12 20:03:50,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:50,819 INFO L225 Difference]: With dead ends: 3056 [2024-10-12 20:03:50,819 INFO L226 Difference]: Without dead ends: 2546 [2024-10-12 20:03:50,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:03:50,821 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 163 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:50,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 262 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:03:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2024-10-12 20:03:50,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2172. [2024-10-12 20:03:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 2171 states have (on average 1.4090280976508522) internal successors, (3059), 2171 states have internal predecessors, (3059), 0 states have call successors, (0), 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 20:03:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3059 transitions. [2024-10-12 20:03:50,894 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3059 transitions. Word has length 49 [2024-10-12 20:03:50,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:50,895 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 3059 transitions. [2024-10-12 20:03:50,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 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 20:03:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3059 transitions. [2024-10-12 20:03:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 20:03:50,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:50,896 INFO L215 NwaCegarLoop]: trace histogram [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 20:03:50,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:03:50,896 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:50,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:50,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1885157086, now seen corresponding path program 1 times [2024-10-12 20:03:50,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:50,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113716362] [2024-10-12 20:03:50,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:50,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:03:50,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:50,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113716362] [2024-10-12 20:03:50,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113716362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:50,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:50,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:03:50,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58654415] [2024-10-12 20:03:50,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:50,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:03:50,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:50,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:03:50,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:50,970 INFO L87 Difference]: Start difference. First operand 2172 states and 3059 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 20:03:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:51,057 INFO L93 Difference]: Finished difference Result 4324 states and 6097 transitions. [2024-10-12 20:03:51,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:03:51,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-12 20:03:51,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:51,065 INFO L225 Difference]: With dead ends: 4324 [2024-10-12 20:03:51,065 INFO L226 Difference]: Without dead ends: 2174 [2024-10-12 20:03:51,067 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 20:03:51,068 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 29 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:51,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 134 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2024-10-12 20:03:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2172. [2024-10-12 20:03:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 2171 states have (on average 1.3859972362966375) internal successors, (3009), 2171 states have internal predecessors, (3009), 0 states have call successors, (0), 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 20:03:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3009 transitions. [2024-10-12 20:03:51,138 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3009 transitions. Word has length 50 [2024-10-12 20:03:51,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:51,139 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 3009 transitions. [2024-10-12 20:03:51,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 20:03:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3009 transitions. [2024-10-12 20:03:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 20:03:51,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:51,140 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:03:51,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:03:51,140 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:51,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:51,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1001536681, now seen corresponding path program 1 times [2024-10-12 20:03:51,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:51,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518267933] [2024-10-12 20:03:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:51,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:03:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518267933] [2024-10-12 20:03:51,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518267933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:51,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:51,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:03:51,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201453314] [2024-10-12 20:03:51,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:51,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:03:51,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:51,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:03:51,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:51,234 INFO L87 Difference]: Start difference. First operand 2172 states and 3009 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 20:03:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:51,271 INFO L93 Difference]: Finished difference Result 3018 states and 4196 transitions. [2024-10-12 20:03:51,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:03:51,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-12 20:03:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:51,275 INFO L225 Difference]: With dead ends: 3018 [2024-10-12 20:03:51,275 INFO L226 Difference]: Without dead ends: 868 [2024-10-12 20:03:51,277 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 20:03:51,277 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:51,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 131 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:51,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-10-12 20:03:51,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 861. [2024-10-12 20:03:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 1.3767441860465117) internal successors, (1184), 860 states have internal predecessors, (1184), 0 states have call successors, (0), 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 20:03:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1184 transitions. [2024-10-12 20:03:51,307 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1184 transitions. Word has length 51 [2024-10-12 20:03:51,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:51,307 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1184 transitions. [2024-10-12 20:03:51,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 20:03:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1184 transitions. [2024-10-12 20:03:51,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:03:51,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:51,308 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:03:51,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:03:51,309 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:51,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:51,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1455204816, now seen corresponding path program 1 times [2024-10-12 20:03:51,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:51,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204379844] [2024-10-12 20:03:51,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:51,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:03:51,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:51,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204379844] [2024-10-12 20:03:51,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204379844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:51,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:51,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:03:51,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399317933] [2024-10-12 20:03:51,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:51,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:03:51,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:51,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:03:51,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:51,394 INFO L87 Difference]: Start difference. First operand 861 states and 1184 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:03:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:51,418 INFO L93 Difference]: Finished difference Result 1279 states and 1762 transitions. [2024-10-12 20:03:51,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:03:51,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-12 20:03:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:51,421 INFO L225 Difference]: With dead ends: 1279 [2024-10-12 20:03:51,421 INFO L226 Difference]: Without dead ends: 449 [2024-10-12 20:03:51,422 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 20:03:51,422 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 25 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:51,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 110 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-12 20:03:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2024-10-12 20:03:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.34304932735426) internal successors, (599), 446 states have internal predecessors, (599), 0 states have call successors, (0), 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 20:03:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 599 transitions. [2024-10-12 20:03:51,462 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 599 transitions. Word has length 52 [2024-10-12 20:03:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:51,463 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 599 transitions. [2024-10-12 20:03:51,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:03:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 599 transitions. [2024-10-12 20:03:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:03:51,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:51,464 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:03:51,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:03:51,464 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:51,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:51,464 INFO L85 PathProgramCache]: Analyzing trace with hash 923352062, now seen corresponding path program 1 times [2024-10-12 20:03:51,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:51,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288445206] [2024-10-12 20:03:51,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:51,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:03:51,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:51,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288445206] [2024-10-12 20:03:51,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288445206] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:03:51,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146065911] [2024-10-12 20:03:51,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:51,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:03:51,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:03:51,604 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 20:03:51,605 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 20:03:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:51,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 20:03:51,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:03:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:03:51,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:03:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:03:52,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146065911] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:03:52,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:03:52,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 8 [2024-10-12 20:03:52,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785118225] [2024-10-12 20:03:52,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:03:52,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:03:52,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:52,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:03:52,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:03:52,132 INFO L87 Difference]: Start difference. First operand 447 states and 599 transitions. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 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 20:03:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:52,223 INFO L93 Difference]: Finished difference Result 1438 states and 1922 transitions. [2024-10-12 20:03:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:03:52,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 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 54 [2024-10-12 20:03:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:52,228 INFO L225 Difference]: With dead ends: 1438 [2024-10-12 20:03:52,228 INFO L226 Difference]: Without dead ends: 1022 [2024-10-12 20:03:52,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:03:52,229 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 85 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:52,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 281 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2024-10-12 20:03:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 975. [2024-10-12 20:03:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 1.286447638603696) internal successors, (1253), 974 states have internal predecessors, (1253), 0 states have call successors, (0), 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 20:03:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1253 transitions. [2024-10-12 20:03:52,266 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1253 transitions. Word has length 54 [2024-10-12 20:03:52,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:52,266 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1253 transitions. [2024-10-12 20:03:52,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 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 20:03:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1253 transitions. [2024-10-12 20:03:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:03:52,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:52,267 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:03:52,293 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 20:03:52,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-12 20:03:52,469 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:52,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:52,470 INFO L85 PathProgramCache]: Analyzing trace with hash 122236493, now seen corresponding path program 1 times [2024-10-12 20:03:52,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:52,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113615187] [2024-10-12 20:03:52,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:52,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:03:54,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:54,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113615187] [2024-10-12 20:03:54,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113615187] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:03:54,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537648256] [2024-10-12 20:03:54,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:54,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:03:54,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:03:54,628 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 20:03:54,630 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 20:03:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:54,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 20:03:54,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:03:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:03:55,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:03:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:03:55,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537648256] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:03:55,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:03:55,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2024-10-12 20:03:55,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242941425] [2024-10-12 20:03:55,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:03:55,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-12 20:03:55,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:55,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-12 20:03:55,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2024-10-12 20:03:55,807 INFO L87 Difference]: Start difference. First operand 975 states and 1253 transitions. Second operand has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 23 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 20:03:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:56,318 INFO L93 Difference]: Finished difference Result 2799 states and 3630 transitions. [2024-10-12 20:03:56,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:03:56,319 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 23 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 55 [2024-10-12 20:03:56,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:56,326 INFO L225 Difference]: With dead ends: 2799 [2024-10-12 20:03:56,326 INFO L226 Difference]: Without dead ends: 1948 [2024-10-12 20:03:56,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=936, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 20:03:56,329 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1000 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:56,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 308 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:03:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2024-10-12 20:03:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1910. [2024-10-12 20:03:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1909 states have (on average 1.2692509167103196) internal successors, (2423), 1909 states have internal predecessors, (2423), 0 states have call successors, (0), 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 20:03:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2423 transitions. [2024-10-12 20:03:56,395 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2423 transitions. Word has length 55 [2024-10-12 20:03:56,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:56,395 INFO L471 AbstractCegarLoop]: Abstraction has 1910 states and 2423 transitions. [2024-10-12 20:03:56,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 23 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 20:03:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2423 transitions. [2024-10-12 20:03:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:03:56,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:56,396 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:03:56,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 20:03:56,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-12 20:03:56,598 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:56,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:56,598 INFO L85 PathProgramCache]: Analyzing trace with hash -25697971, now seen corresponding path program 1 times [2024-10-12 20:03:56,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:56,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428708002] [2024-10-12 20:03:56,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:56,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:56,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:03:56,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:56,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428708002] [2024-10-12 20:03:56,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428708002] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:03:56,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909004972] [2024-10-12 20:03:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:56,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:03:56,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:03:56,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:03:56,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 20:03:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:57,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 20:03:57,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:03:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:03:57,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:03:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:03:58,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909004972] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:03:58,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:03:58,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-10-12 20:03:58,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941888874] [2024-10-12 20:03:58,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:03:58,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-12 20:03:58,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:58,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-12 20:03:58,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-10-12 20:03:58,124 INFO L87 Difference]: Start difference. First operand 1910 states and 2423 transitions. Second operand has 20 states, 20 states have (on average 5.9) internal successors, (118), 19 states have internal predecessors, (118), 0 states have call successors, (0), 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 20:03:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:58,511 INFO L93 Difference]: Finished difference Result 3978 states and 5083 transitions. [2024-10-12 20:03:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:03:58,512 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.9) internal successors, (118), 19 states have internal predecessors, (118), 0 states have call successors, (0), 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 55 [2024-10-12 20:03:58,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:58,520 INFO L225 Difference]: With dead ends: 3978 [2024-10-12 20:03:58,520 INFO L226 Difference]: Without dead ends: 2403 [2024-10-12 20:03:58,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2024-10-12 20:03:58,523 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 696 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:58,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 250 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:03:58,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2024-10-12 20:03:58,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2399. [2024-10-12 20:03:58,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2398 states have (on average 1.2689741451209342) internal successors, (3043), 2398 states have internal predecessors, (3043), 0 states have call successors, (0), 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 20:03:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 3043 transitions. [2024-10-12 20:03:58,610 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 3043 transitions. Word has length 55 [2024-10-12 20:03:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:58,610 INFO L471 AbstractCegarLoop]: Abstraction has 2399 states and 3043 transitions. [2024-10-12 20:03:58,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.9) internal successors, (118), 19 states have internal predecessors, (118), 0 states have call successors, (0), 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 20:03:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3043 transitions. [2024-10-12 20:03:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:03:58,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:58,611 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:03:58,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 20:03:58,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 20:03:58,812 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:58,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:58,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1288816485, now seen corresponding path program 1 times [2024-10-12 20:03:58,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:58,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977544807] [2024-10-12 20:03:58,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:58,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:59,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:03:59,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:59,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977544807] [2024-10-12 20:03:59,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977544807] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:03:59,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864101725] [2024-10-12 20:03:59,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:59,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:03:59,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:03:59,142 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:03:59,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 20:03:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:59,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-12 20:03:59,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:04:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:00,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:04:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:02,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864101725] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:04:02,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:04:02,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 34 [2024-10-12 20:04:02,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72158790] [2024-10-12 20:04:02,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:04:02,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-12 20:04:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:02,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-12 20:04:02,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122 [2024-10-12 20:04:02,315 INFO L87 Difference]: Start difference. First operand 2399 states and 3043 transitions. Second operand has 34 states, 34 states have (on average 4.382352941176471) internal successors, (149), 34 states have internal predecessors, (149), 0 states have call successors, (0), 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 20:04:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:04,930 INFO L93 Difference]: Finished difference Result 6688 states and 8497 transitions. [2024-10-12 20:04:04,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-12 20:04:04,931 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.382352941176471) internal successors, (149), 34 states have internal predecessors, (149), 0 states have call successors, (0), 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 55 [2024-10-12 20:04:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:04,946 INFO L225 Difference]: With dead ends: 6688 [2024-10-12 20:04:04,947 INFO L226 Difference]: Without dead ends: 4574 [2024-10-12 20:04:04,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1547 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1261, Invalid=4289, Unknown=0, NotChecked=0, Total=5550 [2024-10-12 20:04:04,952 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 1455 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:04,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 988 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:04:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2024-10-12 20:04:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4556. [2024-10-12 20:04:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4556 states, 4555 states have (on average 1.2476399560922065) internal successors, (5683), 4555 states have internal predecessors, (5683), 0 states have call successors, (0), 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 20:04:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4556 states to 4556 states and 5683 transitions. [2024-10-12 20:04:05,121 INFO L78 Accepts]: Start accepts. Automaton has 4556 states and 5683 transitions. Word has length 55 [2024-10-12 20:04:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:05,122 INFO L471 AbstractCegarLoop]: Abstraction has 4556 states and 5683 transitions. [2024-10-12 20:04:05,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.382352941176471) internal successors, (149), 34 states have internal predecessors, (149), 0 states have call successors, (0), 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 20:04:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 4556 states and 5683 transitions. [2024-10-12 20:04:05,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 20:04:05,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:05,123 INFO L215 NwaCegarLoop]: trace histogram [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 20:04:05,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 20:04:05,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:05,326 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:05,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:05,326 INFO L85 PathProgramCache]: Analyzing trace with hash -769882752, now seen corresponding path program 1 times [2024-10-12 20:04:05,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:05,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736298776] [2024-10-12 20:04:05,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:05,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:06,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:06,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736298776] [2024-10-12 20:04:06,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736298776] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:04:06,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942190824] [2024-10-12 20:04:06,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:06,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:06,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:04:06,517 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:04:06,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 20:04:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:06,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-12 20:04:06,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:04:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:09,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:04:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:10,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942190824] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:04:10,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:04:10,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 16] total 51 [2024-10-12 20:04:10,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746636244] [2024-10-12 20:04:10,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:04:10,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-12 20:04:10,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:10,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-12 20:04:10,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2295, Unknown=0, NotChecked=0, Total=2550 [2024-10-12 20:04:10,584 INFO L87 Difference]: Start difference. First operand 4556 states and 5683 transitions. Second operand has 51 states, 51 states have (on average 3.0392156862745097) internal successors, (155), 51 states have internal predecessors, (155), 0 states have call successors, (0), 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 20:04:23,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:23,042 INFO L93 Difference]: Finished difference Result 9306 states and 11631 transitions. [2024-10-12 20:04:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-10-12 20:04:23,043 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.0392156862745097) internal successors, (155), 51 states have internal predecessors, (155), 0 states have call successors, (0), 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 56 [2024-10-12 20:04:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:23,066 INFO L225 Difference]: With dead ends: 9306 [2024-10-12 20:04:23,067 INFO L226 Difference]: Without dead ends: 6941 [2024-10-12 20:04:23,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4742 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=3460, Invalid=14096, Unknown=0, NotChecked=0, Total=17556 [2024-10-12 20:04:23,074 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 2782 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2782 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:23,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2782 Valid, 1777 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2428 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 20:04:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6941 states. [2024-10-12 20:04:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6941 to 5597. [2024-10-12 20:04:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.246962115796998) internal successors, (6978), 5596 states have internal predecessors, (6978), 0 states have call successors, (0), 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 20:04:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6978 transitions. [2024-10-12 20:04:23,358 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 6978 transitions. Word has length 56 [2024-10-12 20:04:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:23,358 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 6978 transitions. [2024-10-12 20:04:23,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.0392156862745097) internal successors, (155), 51 states have internal predecessors, (155), 0 states have call successors, (0), 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 20:04:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 6978 transitions. [2024-10-12 20:04:23,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 20:04:23,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:23,359 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:04:23,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 20:04:23,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:23,564 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:23,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:23,565 INFO L85 PathProgramCache]: Analyzing trace with hash 825933843, now seen corresponding path program 1 times [2024-10-12 20:04:23,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:23,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003068003] [2024-10-12 20:04:23,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:23,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:24,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003068003] [2024-10-12 20:04:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003068003] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:04:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111193328] [2024-10-12 20:04:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:24,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:24,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:04:24,188 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:04:24,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 20:04:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:24,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 20:04:24,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:04:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:24,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:04:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:25,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111193328] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:04:25,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:04:25,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2024-10-12 20:04:25,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498246584] [2024-10-12 20:04:25,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:04:25,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-12 20:04:25,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:25,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 20:04:25,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-10-12 20:04:25,486 INFO L87 Difference]: Start difference. First operand 5597 states and 6978 transitions. Second operand has 30 states, 30 states have (on average 4.466666666666667) internal successors, (134), 29 states have internal predecessors, (134), 0 states have call successors, (0), 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 20:04:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:26,187 INFO L93 Difference]: Finished difference Result 7091 states and 8832 transitions. [2024-10-12 20:04:26,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:04:26,188 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.466666666666667) internal successors, (134), 29 states have internal predecessors, (134), 0 states have call successors, (0), 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 57 [2024-10-12 20:04:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:26,197 INFO L225 Difference]: With dead ends: 7091 [2024-10-12 20:04:26,197 INFO L226 Difference]: Without dead ends: 3511 [2024-10-12 20:04:26,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=366, Invalid=1356, Unknown=0, NotChecked=0, Total=1722 [2024-10-12 20:04:26,203 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 656 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:26,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 661 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:04:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2024-10-12 20:04:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3071. [2024-10-12 20:04:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3071 states, 3070 states have (on average 1.2537459283387622) internal successors, (3849), 3070 states have internal predecessors, (3849), 0 states have call successors, (0), 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 20:04:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 3849 transitions. [2024-10-12 20:04:26,354 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 3849 transitions. Word has length 57 [2024-10-12 20:04:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:26,354 INFO L471 AbstractCegarLoop]: Abstraction has 3071 states and 3849 transitions. [2024-10-12 20:04:26,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.466666666666667) internal successors, (134), 29 states have internal predecessors, (134), 0 states have call successors, (0), 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 20:04:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 3849 transitions. [2024-10-12 20:04:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 20:04:26,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:26,356 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:04:26,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 20:04:26,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:26,557 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:26,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:26,558 INFO L85 PathProgramCache]: Analyzing trace with hash -318439098, now seen corresponding path program 1 times [2024-10-12 20:04:26,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:26,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071111079] [2024-10-12 20:04:26,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:26,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:27,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:27,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071111079] [2024-10-12 20:04:27,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071111079] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:04:27,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197904007] [2024-10-12 20:04:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:27,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:27,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:04:27,081 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:04:27,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 20:04:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:27,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-12 20:04:27,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:04:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:28,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:04:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:29,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197904007] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:04:29,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:04:29,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 17] total 42 [2024-10-12 20:04:29,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866595943] [2024-10-12 20:04:29,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:04:29,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-12 20:04:29,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:29,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-12 20:04:29,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1519, Unknown=0, NotChecked=0, Total=1806 [2024-10-12 20:04:30,000 INFO L87 Difference]: Start difference. First operand 3071 states and 3849 transitions. Second operand has 43 states, 43 states have (on average 3.5348837209302326) internal successors, (152), 42 states have internal predecessors, (152), 0 states have call successors, (0), 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 20:04:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:32,302 INFO L93 Difference]: Finished difference Result 5345 states and 6710 transitions. [2024-10-12 20:04:32,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-12 20:04:32,303 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.5348837209302326) internal successors, (152), 42 states have internal predecessors, (152), 0 states have call successors, (0), 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 58 [2024-10-12 20:04:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:32,317 INFO L225 Difference]: With dead ends: 5345 [2024-10-12 20:04:32,317 INFO L226 Difference]: Without dead ends: 3948 [2024-10-12 20:04:32,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1120, Invalid=4136, Unknown=0, NotChecked=0, Total=5256 [2024-10-12 20:04:32,323 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 957 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:32,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 650 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:04:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2024-10-12 20:04:32,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 2995. [2024-10-12 20:04:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2995 states, 2994 states have (on average 1.2458249832999333) internal successors, (3730), 2994 states have internal predecessors, (3730), 0 states have call successors, (0), 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 20:04:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 3730 transitions. [2024-10-12 20:04:32,457 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 3730 transitions. Word has length 58 [2024-10-12 20:04:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:32,457 INFO L471 AbstractCegarLoop]: Abstraction has 2995 states and 3730 transitions. [2024-10-12 20:04:32,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.5348837209302326) internal successors, (152), 42 states have internal predecessors, (152), 0 states have call successors, (0), 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 20:04:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 3730 transitions. [2024-10-12 20:04:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:04:32,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:32,459 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2024-10-12 20:04:32,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 20:04:32,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:32,660 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:32,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:32,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1002457202, now seen corresponding path program 1 times [2024-10-12 20:04:32,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:32,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972658345] [2024-10-12 20:04:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:32,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 36 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:33,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:33,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972658345] [2024-10-12 20:04:33,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972658345] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:04:33,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550731323] [2024-10-12 20:04:33,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:33,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:33,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:04:33,509 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:04:33,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 20:04:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:33,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 20:04:33,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:04:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 30 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:34,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:04:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 28 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:35,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550731323] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:04:35,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:04:35,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 34 [2024-10-12 20:04:35,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521048621] [2024-10-12 20:04:35,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:04:35,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-12 20:04:35,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:35,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-12 20:04:35,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 20:04:35,576 INFO L87 Difference]: Start difference. First operand 2995 states and 3730 transitions. Second operand has 35 states, 35 states have (on average 7.085714285714285) internal successors, (248), 34 states have internal predecessors, (248), 0 states have call successors, (0), 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 20:04:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:43,005 INFO L93 Difference]: Finished difference Result 19617 states and 24929 transitions. [2024-10-12 20:04:43,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2024-10-12 20:04:43,005 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.085714285714285) internal successors, (248), 34 states have internal predecessors, (248), 0 states have call successors, (0), 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 92 [2024-10-12 20:04:43,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:43,033 INFO L225 Difference]: With dead ends: 19617 [2024-10-12 20:04:43,034 INFO L226 Difference]: Without dead ends: 16895 [2024-10-12 20:04:43,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8809 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=4089, Invalid=22971, Unknown=0, NotChecked=0, Total=27060 [2024-10-12 20:04:43,044 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 2624 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 2027 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2624 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:43,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2624 Valid, 2022 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2027 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:04:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16895 states. [2024-10-12 20:04:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16895 to 11093. [2024-10-12 20:04:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11093 states, 11092 states have (on average 1.2426072845293905) internal successors, (13783), 11092 states have internal predecessors, (13783), 0 states have call successors, (0), 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 20:04:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11093 states to 11093 states and 13783 transitions. [2024-10-12 20:04:43,650 INFO L78 Accepts]: Start accepts. Automaton has 11093 states and 13783 transitions. Word has length 92 [2024-10-12 20:04:43,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:43,651 INFO L471 AbstractCegarLoop]: Abstraction has 11093 states and 13783 transitions. [2024-10-12 20:04:43,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.085714285714285) internal successors, (248), 34 states have internal predecessors, (248), 0 states have call successors, (0), 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 20:04:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 11093 states and 13783 transitions. [2024-10-12 20:04:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 20:04:43,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:43,654 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:04:43,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-12 20:04:43,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-12 20:04:43,854 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:43,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1098499603, now seen corresponding path program 1 times [2024-10-12 20:04:43,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:43,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827183827] [2024-10-12 20:04:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:44,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:44,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827183827] [2024-10-12 20:04:44,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827183827] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:04:44,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042480195] [2024-10-12 20:04:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:44,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:44,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:04:44,637 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:04:44,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 20:04:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:44,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-12 20:04:44,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:04:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:45,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:04:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:46,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042480195] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:04:46,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:04:46,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 12] total 36 [2024-10-12 20:04:46,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843422261] [2024-10-12 20:04:46,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:04:46,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-12 20:04:46,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:46,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-12 20:04:46,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2024-10-12 20:04:46,665 INFO L87 Difference]: Start difference. First operand 11093 states and 13783 transitions. Second operand has 36 states, 36 states have (on average 6.25) internal successors, (225), 36 states have internal predecessors, (225), 0 states have call successors, (0), 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 20:04:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:51,777 INFO L93 Difference]: Finished difference Result 28383 states and 35544 transitions. [2024-10-12 20:04:51,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-12 20:04:51,778 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 6.25) internal successors, (225), 36 states have internal predecessors, (225), 0 states have call successors, (0), 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 93 [2024-10-12 20:04:51,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:51,802 INFO L225 Difference]: With dead ends: 28383 [2024-10-12 20:04:51,802 INFO L226 Difference]: Without dead ends: 18041 [2024-10-12 20:04:51,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2736 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1654, Invalid=7658, Unknown=0, NotChecked=0, Total=9312 [2024-10-12 20:04:51,812 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1103 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:51,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1760 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 20:04:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18041 states. [2024-10-12 20:04:52,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18041 to 7263. [2024-10-12 20:04:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7263 states, 7262 states have (on average 1.2335444781052052) internal successors, (8958), 7262 states have internal predecessors, (8958), 0 states have call successors, (0), 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 20:04:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7263 states to 7263 states and 8958 transitions. [2024-10-12 20:04:52,336 INFO L78 Accepts]: Start accepts. Automaton has 7263 states and 8958 transitions. Word has length 93 [2024-10-12 20:04:52,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:52,337 INFO L471 AbstractCegarLoop]: Abstraction has 7263 states and 8958 transitions. [2024-10-12 20:04:52,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 6.25) internal successors, (225), 36 states have internal predecessors, (225), 0 states have call successors, (0), 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 20:04:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 7263 states and 8958 transitions. [2024-10-12 20:04:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 20:04:52,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:52,339 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:04:52,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-12 20:04:52,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-12 20:04:52,544 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:52,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:52,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1275648929, now seen corresponding path program 1 times [2024-10-12 20:04:52,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:52,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020484475] [2024-10-12 20:04:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:52,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:54,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:54,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020484475] [2024-10-12 20:04:54,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020484475] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:04:54,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082669527] [2024-10-12 20:04:54,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:54,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:54,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:04:54,339 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:04:54,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 20:04:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:54,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-12 20:04:54,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:04:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:56,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:05:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:01,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082669527] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:05:01,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:05:01,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 23] total 69 [2024-10-12 20:05:01,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3809558] [2024-10-12 20:05:01,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:05:01,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-10-12 20:05:01,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:01,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-10-12 20:05:01,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=4298, Unknown=0, NotChecked=0, Total=4692 [2024-10-12 20:05:01,734 INFO L87 Difference]: Start difference. First operand 7263 states and 8958 transitions. Second operand has 69 states, 69 states have (on average 3.782608695652174) internal successors, (261), 69 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)