./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_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_opt-floodmax.4.1.ufo.BOUNDED-8.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 77af8780d2ec99ad0d03b475aa25db67a7ba0a218594f51cddbe35460cd2b670 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:27:30,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:27:30,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:27:30,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:27:30,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:27:30,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:27:30,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:27:30,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:27:30,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:27:30,896 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:27:30,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:27:30,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:27:30,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:27:30,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:27:30,898 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:27:30,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:27:30,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:27:30,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:27:30,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:27:30,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:27:30,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:27:30,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:27:30,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:27:30,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:27:30,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:27:30,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:27:30,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:27:30,901 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:27:30,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:27:30,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:27:30,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:27:30,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:27:30,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:27:30,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:27:30,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:27:30,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:27:30,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:27:30,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:27:30,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:27:30,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:27:30,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:27:30,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:27:30,903 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 -> 77af8780d2ec99ad0d03b475aa25db67a7ba0a218594f51cddbe35460cd2b670 [2024-10-24 01:27:31,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:27:31,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:27:31,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:27:31,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:27:31,114 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:27:31,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c [2024-10-24 01:27:32,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:27:32,523 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:27:32,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c [2024-10-24 01:27:32,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0bdfbe7f/1b32a93fdc9b4dac8acc79f781194308/FLAG9b651d35a [2024-10-24 01:27:32,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0bdfbe7f/1b32a93fdc9b4dac8acc79f781194308 [2024-10-24 01:27:32,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:27:32,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:27:32,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:27:32,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:27:32,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:27:32,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:27:32" (1/1) ... [2024-10-24 01:27:32,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd8bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:32, skipping insertion in model container [2024-10-24 01:27:32,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:27:32" (1/1) ... [2024-10-24 01:27:32,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:27:33,169 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_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c[26618,26631] [2024-10-24 01:27:33,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:27:33,184 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:27:33,242 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_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c[26618,26631] [2024-10-24 01:27:33,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:27:33,266 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:27:33,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:33 WrapperNode [2024-10-24 01:27:33,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:27:33,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:27:33,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:27:33,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:27:33,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:33" (1/1) ... [2024-10-24 01:27:33,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:33" (1/1) ... [2024-10-24 01:27:33,316 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 998 [2024-10-24 01:27:33,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:27:33,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:27:33,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:27:33,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:27:33,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:33" (1/1) ... [2024-10-24 01:27:33,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:33" (1/1) ... [2024-10-24 01:27:33,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:33" (1/1) ... [2024-10-24 01:27:33,357 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-24 01:27:33,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:33" (1/1) ... [2024-10-24 01:27:33,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:33" (1/1) ... [2024-10-24 01:27:33,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:33" (1/1) ... [2024-10-24 01:27:33,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:33" (1/1) ... [2024-10-24 01:27:33,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:33" (1/1) ... [2024-10-24 01:27:33,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:33" (1/1) ... [2024-10-24 01:27:33,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:27:33,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:27:33,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:27:33,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:27:33,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:33" (1/1) ... [2024-10-24 01:27:33,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:27:33,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:27:33,453 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-24 01:27:33,455 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-24 01:27:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:27:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:27:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:27:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:27:33,605 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:27:33,606 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:27:34,462 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-10-24 01:27:34,463 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:27:34,520 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:27:34,521 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 01:27:34,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:27:34 BoogieIcfgContainer [2024-10-24 01:27:34,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:27:34,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:27:34,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:27:34,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:27:34,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:27:32" (1/3) ... [2024-10-24 01:27:34,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab02971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:27:34, skipping insertion in model container [2024-10-24 01:27:34,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:33" (2/3) ... [2024-10-24 01:27:34,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab02971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:27:34, skipping insertion in model container [2024-10-24 01:27:34,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:27:34" (3/3) ... [2024-10-24 01:27:34,529 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c [2024-10-24 01:27:34,542 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:27:34,542 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:27:34,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:27:34,615 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;@2a91649b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:27:34,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:27:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.8398576512455516) internal successors, (517), 282 states have internal predecessors, (517), 0 states have call successors, (0), 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-24 01:27:34,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:27:34,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:34,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:27:34,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:34,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:34,638 INFO L85 PathProgramCache]: Analyzing trace with hash -70701989, now seen corresponding path program 1 times [2024-10-24 01:27:34,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:34,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148010629] [2024-10-24 01:27:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:35,046 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-24 01:27:35,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148010629] [2024-10-24 01:27:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148010629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:35,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:35,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 01:27:35,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741407454] [2024-10-24 01:27:35,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:35,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 01:27:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:35,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 01:27:35,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:27:35,073 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.8398576512455516) internal successors, (517), 282 states have internal predecessors, (517), 0 states have call successors, (0), 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 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 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-24 01:27:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:35,159 INFO L93 Difference]: Finished difference Result 385 states and 698 transitions. [2024-10-24 01:27:35,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 01:27:35,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-24 01:27:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:35,176 INFO L225 Difference]: With dead ends: 385 [2024-10-24 01:27:35,176 INFO L226 Difference]: Without dead ends: 281 [2024-10-24 01:27:35,179 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-24 01:27:35,181 INFO L432 NwaCegarLoop]: 510 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, 510 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-24 01:27:35,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 510 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-24 01:27:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-24 01:27:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.8285714285714285) internal successors, (512), 280 states have internal predecessors, (512), 0 states have call successors, (0), 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-24 01:27:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 512 transitions. [2024-10-24 01:27:35,228 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 512 transitions. Word has length 74 [2024-10-24 01:27:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:35,229 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 512 transitions. [2024-10-24 01:27:35,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 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-24 01:27:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 512 transitions. [2024-10-24 01:27:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:27:35,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:35,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:27:35,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:27:35,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:35,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:35,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1876140323, now seen corresponding path program 1 times [2024-10-24 01:27:35,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:35,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174181066] [2024-10-24 01:27:35,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:35,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:35,483 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-24 01:27:35,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:35,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174181066] [2024-10-24 01:27:35,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174181066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:35,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:35,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:35,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412232133] [2024-10-24 01:27:35,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:35,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:35,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:35,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:35,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:35,489 INFO L87 Difference]: Start difference. First operand 281 states and 512 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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-24 01:27:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:35,624 INFO L93 Difference]: Finished difference Result 383 states and 691 transitions. [2024-10-24 01:27:35,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:35,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-24 01:27:35,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:35,626 INFO L225 Difference]: With dead ends: 383 [2024-10-24 01:27:35,626 INFO L226 Difference]: Without dead ends: 281 [2024-10-24 01:27:35,627 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-24 01:27:35,628 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 0 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:35,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1490 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:35,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-24 01:27:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-24 01:27:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.707142857142857) internal successors, (478), 280 states have internal predecessors, (478), 0 states have call successors, (0), 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-24 01:27:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 478 transitions. [2024-10-24 01:27:35,658 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 478 transitions. Word has length 74 [2024-10-24 01:27:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:35,659 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 478 transitions. [2024-10-24 01:27:35,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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-24 01:27:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 478 transitions. [2024-10-24 01:27:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 01:27:35,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:35,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:35,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:27:35,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:35,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:35,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1223317231, now seen corresponding path program 1 times [2024-10-24 01:27:35,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:35,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872112363] [2024-10-24 01:27:35,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:35,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:35,835 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-24 01:27:35,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:35,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872112363] [2024-10-24 01:27:35,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872112363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:35,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:35,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:35,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632206441] [2024-10-24 01:27:35,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:35,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:35,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:35,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:35,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:35,837 INFO L87 Difference]: Start difference. First operand 281 states and 478 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-24 01:27:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:35,897 INFO L93 Difference]: Finished difference Result 467 states and 808 transitions. [2024-10-24 01:27:35,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:35,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-10-24 01:27:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:35,905 INFO L225 Difference]: With dead ends: 467 [2024-10-24 01:27:35,905 INFO L226 Difference]: Without dead ends: 368 [2024-10-24 01:27:35,906 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-24 01:27:35,907 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 146 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:35,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 910 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-24 01:27:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 366. [2024-10-24 01:27:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 1.715068493150685) internal successors, (626), 365 states have internal predecessors, (626), 0 states have call successors, (0), 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-24 01:27:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 626 transitions. [2024-10-24 01:27:35,925 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 626 transitions. Word has length 107 [2024-10-24 01:27:35,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:35,925 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 626 transitions. [2024-10-24 01:27:35,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-24 01:27:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 626 transitions. [2024-10-24 01:27:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 01:27:35,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:35,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:35,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:27:35,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:35,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:35,931 INFO L85 PathProgramCache]: Analyzing trace with hash -449650279, now seen corresponding path program 1 times [2024-10-24 01:27:35,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:35,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542993313] [2024-10-24 01:27:35,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:35,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:36,048 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-24 01:27:36,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:36,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542993313] [2024-10-24 01:27:36,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542993313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:36,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:36,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:36,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475339649] [2024-10-24 01:27:36,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:36,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:36,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:36,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:36,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:36,050 INFO L87 Difference]: Start difference. First operand 366 states and 626 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-24 01:27:36,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:36,120 INFO L93 Difference]: Finished difference Result 714 states and 1238 transitions. [2024-10-24 01:27:36,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:36,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-10-24 01:27:36,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:36,123 INFO L225 Difference]: With dead ends: 714 [2024-10-24 01:27:36,123 INFO L226 Difference]: Without dead ends: 530 [2024-10-24 01:27:36,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:36,124 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 147 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:36,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 918 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:36,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-10-24 01:27:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2024-10-24 01:27:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.72865275142315) internal successors, (911), 527 states have internal predecessors, (911), 0 states have call successors, (0), 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-24 01:27:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 911 transitions. [2024-10-24 01:27:36,138 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 911 transitions. Word has length 110 [2024-10-24 01:27:36,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:36,138 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 911 transitions. [2024-10-24 01:27:36,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-24 01:27:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 911 transitions. [2024-10-24 01:27:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 01:27:36,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:36,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:36,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:27:36,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:36,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash -902639938, now seen corresponding path program 1 times [2024-10-24 01:27:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:36,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509624372] [2024-10-24 01:27:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:36,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:36,245 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-24 01:27:36,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:36,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509624372] [2024-10-24 01:27:36,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509624372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:36,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:36,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:36,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550080743] [2024-10-24 01:27:36,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:36,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:36,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:36,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:36,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:36,247 INFO L87 Difference]: Start difference. First operand 528 states and 911 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-24 01:27:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:36,290 INFO L93 Difference]: Finished difference Result 1180 states and 2057 transitions. [2024-10-24 01:27:36,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:36,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-24 01:27:36,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:36,294 INFO L225 Difference]: With dead ends: 1180 [2024-10-24 01:27:36,294 INFO L226 Difference]: Without dead ends: 834 [2024-10-24 01:27:36,295 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-24 01:27:36,296 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 140 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:36,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 919 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-10-24 01:27:36,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 832. [2024-10-24 01:27:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 831 states have (on average 1.736462093862816) internal successors, (1443), 831 states have internal predecessors, (1443), 0 states have call successors, (0), 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-24 01:27:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1443 transitions. [2024-10-24 01:27:36,318 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1443 transitions. Word has length 113 [2024-10-24 01:27:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:36,319 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1443 transitions. [2024-10-24 01:27:36,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-24 01:27:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1443 transitions. [2024-10-24 01:27:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 01:27:36,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:36,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:36,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:27:36,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:36,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:36,323 INFO L85 PathProgramCache]: Analyzing trace with hash -294566746, now seen corresponding path program 1 times [2024-10-24 01:27:36,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:36,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24790712] [2024-10-24 01:27:36,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:36,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:36,429 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-24 01:27:36,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:36,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24790712] [2024-10-24 01:27:36,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24790712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:36,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:36,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:36,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411568549] [2024-10-24 01:27:36,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:36,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:36,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:36,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:36,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:36,431 INFO L87 Difference]: Start difference. First operand 832 states and 1443 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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-24 01:27:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:36,506 INFO L93 Difference]: Finished difference Result 2052 states and 3581 transitions. [2024-10-24 01:27:36,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:36,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-10-24 01:27:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:36,510 INFO L225 Difference]: With dead ends: 2052 [2024-10-24 01:27:36,511 INFO L226 Difference]: Without dead ends: 1402 [2024-10-24 01:27:36,512 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-24 01:27:36,514 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 133 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:36,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 920 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:36,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2024-10-24 01:27:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1400. [2024-10-24 01:27:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1399 states have (on average 1.7376697641172265) internal successors, (2431), 1399 states have internal predecessors, (2431), 0 states have call successors, (0), 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-24 01:27:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 2431 transitions. [2024-10-24 01:27:36,541 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 2431 transitions. Word has length 116 [2024-10-24 01:27:36,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:36,543 INFO L471 AbstractCegarLoop]: Abstraction has 1400 states and 2431 transitions. [2024-10-24 01:27:36,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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-24 01:27:36,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 2431 transitions. [2024-10-24 01:27:36,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 01:27:36,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:36,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:36,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:27:36,545 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:36,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:36,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1827244693, now seen corresponding path program 1 times [2024-10-24 01:27:36,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:36,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268836146] [2024-10-24 01:27:36,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:36,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:36,734 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-24 01:27:36,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:36,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268836146] [2024-10-24 01:27:36,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268836146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:36,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:36,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:27:36,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555229832] [2024-10-24 01:27:36,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:36,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:27:36,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:36,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:27:36,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:27:36,737 INFO L87 Difference]: Start difference. First operand 1400 states and 2431 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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-24 01:27:36,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:36,994 INFO L93 Difference]: Finished difference Result 7136 states and 12551 transitions. [2024-10-24 01:27:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:27:36,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-10-24 01:27:36,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:37,011 INFO L225 Difference]: With dead ends: 7136 [2024-10-24 01:27:37,012 INFO L226 Difference]: Without dead ends: 5918 [2024-10-24 01:27:37,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:27:37,017 INFO L432 NwaCegarLoop]: 468 mSDtfsCounter, 1572 mSDsluCounter, 3389 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 3857 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:37,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 3857 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:27:37,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2024-10-24 01:27:37,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 2533. [2024-10-24 01:27:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 2532 states have (on average 1.7413112164296998) internal successors, (4409), 2532 states have internal predecessors, (4409), 0 states have call successors, (0), 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-24 01:27:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 4409 transitions. [2024-10-24 01:27:37,117 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 4409 transitions. Word has length 119 [2024-10-24 01:27:37,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:37,117 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 4409 transitions. [2024-10-24 01:27:37,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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-24 01:27:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 4409 transitions. [2024-10-24 01:27:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 01:27:37,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:37,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:37,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:27:37,120 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:37,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:37,121 INFO L85 PathProgramCache]: Analyzing trace with hash -878214316, now seen corresponding path program 1 times [2024-10-24 01:27:37,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:37,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926636639] [2024-10-24 01:27:37,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:37,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:37,240 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-24 01:27:37,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:37,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926636639] [2024-10-24 01:27:37,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926636639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:37,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:37,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:37,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905960877] [2024-10-24 01:27:37,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:37,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:37,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:37,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:37,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:37,243 INFO L87 Difference]: Start difference. First operand 2533 states and 4409 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-24 01:27:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:37,362 INFO L93 Difference]: Finished difference Result 7378 states and 12938 transitions. [2024-10-24 01:27:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:37,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-10-24 01:27:37,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:37,382 INFO L225 Difference]: With dead ends: 7378 [2024-10-24 01:27:37,382 INFO L226 Difference]: Without dead ends: 5027 [2024-10-24 01:27:37,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:37,389 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 507 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1404 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:37,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1404 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2024-10-24 01:27:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 3763. [2024-10-24 01:27:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3763 states, 3762 states have (on average 1.7434875066454014) internal successors, (6559), 3762 states have internal predecessors, (6559), 0 states have call successors, (0), 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-24 01:27:37,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3763 states to 3763 states and 6559 transitions. [2024-10-24 01:27:37,479 INFO L78 Accepts]: Start accepts. Automaton has 3763 states and 6559 transitions. Word has length 120 [2024-10-24 01:27:37,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:37,480 INFO L471 AbstractCegarLoop]: Abstraction has 3763 states and 6559 transitions. [2024-10-24 01:27:37,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-24 01:27:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3763 states and 6559 transitions. [2024-10-24 01:27:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 01:27:37,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:37,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:37,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:27:37,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:37,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:37,483 INFO L85 PathProgramCache]: Analyzing trace with hash 942827608, now seen corresponding path program 1 times [2024-10-24 01:27:37,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:37,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984594728] [2024-10-24 01:27:37,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:37,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:37,578 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-24 01:27:37,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:37,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984594728] [2024-10-24 01:27:37,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984594728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:37,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:37,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:37,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980529837] [2024-10-24 01:27:37,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:37,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:37,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:37,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:37,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:37,581 INFO L87 Difference]: Start difference. First operand 3763 states and 6559 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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-24 01:27:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:37,668 INFO L93 Difference]: Finished difference Result 8310 states and 14557 transitions. [2024-10-24 01:27:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:37,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-10-24 01:27:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:37,685 INFO L225 Difference]: With dead ends: 8310 [2024-10-24 01:27:37,686 INFO L226 Difference]: Without dead ends: 5766 [2024-10-24 01:27:37,690 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-24 01:27:37,690 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 155 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:37,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1051 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2024-10-24 01:27:37,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5764. [2024-10-24 01:27:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5764 states, 5763 states have (on average 1.7404129793510323) internal successors, (10030), 5763 states have internal predecessors, (10030), 0 states have call successors, (0), 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-24 01:27:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 10030 transitions. [2024-10-24 01:27:37,795 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 10030 transitions. Word has length 121 [2024-10-24 01:27:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:37,795 INFO L471 AbstractCegarLoop]: Abstraction has 5764 states and 10030 transitions. [2024-10-24 01:27:37,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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-24 01:27:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 10030 transitions. [2024-10-24 01:27:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 01:27:37,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:37,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:37,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:27:37,797 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:37,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:37,798 INFO L85 PathProgramCache]: Analyzing trace with hash -600682626, now seen corresponding path program 1 times [2024-10-24 01:27:37,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:37,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074421331] [2024-10-24 01:27:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:37,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:37,884 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-24 01:27:37,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074421331] [2024-10-24 01:27:37,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074421331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:37,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:37,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:37,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617151456] [2024-10-24 01:27:37,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:37,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:37,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:37,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:37,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:37,887 INFO L87 Difference]: Start difference. First operand 5764 states and 10030 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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-24 01:27:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:38,009 INFO L93 Difference]: Finished difference Result 11202 states and 19497 transitions. [2024-10-24 01:27:38,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:38,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-10-24 01:27:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:38,030 INFO L225 Difference]: With dead ends: 11202 [2024-10-24 01:27:38,030 INFO L226 Difference]: Without dead ends: 8128 [2024-10-24 01:27:38,035 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-24 01:27:38,035 INFO L432 NwaCegarLoop]: 597 mSDtfsCounter, 148 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:38,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1045 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8128 states. [2024-10-24 01:27:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8128 to 8126. [2024-10-24 01:27:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8126 states, 8125 states have (on average 1.7316923076923076) internal successors, (14070), 8125 states have internal predecessors, (14070), 0 states have call successors, (0), 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-24 01:27:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 14070 transitions. [2024-10-24 01:27:38,169 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 14070 transitions. Word has length 121 [2024-10-24 01:27:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:38,170 INFO L471 AbstractCegarLoop]: Abstraction has 8126 states and 14070 transitions. [2024-10-24 01:27:38,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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-24 01:27:38,170 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 14070 transitions. [2024-10-24 01:27:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 01:27:38,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:38,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:38,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:27:38,171 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:38,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:38,171 INFO L85 PathProgramCache]: Analyzing trace with hash 491407550, now seen corresponding path program 1 times [2024-10-24 01:27:38,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:38,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670839498] [2024-10-24 01:27:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:38,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:38,242 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-24 01:27:38,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:38,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670839498] [2024-10-24 01:27:38,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670839498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:38,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:38,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:38,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004372127] [2024-10-24 01:27:38,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:38,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:38,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:38,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:38,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:38,244 INFO L87 Difference]: Start difference. First operand 8126 states and 14070 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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-24 01:27:38,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:38,367 INFO L93 Difference]: Finished difference Result 15781 states and 27323 transitions. [2024-10-24 01:27:38,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:38,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-10-24 01:27:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:38,394 INFO L225 Difference]: With dead ends: 15781 [2024-10-24 01:27:38,394 INFO L226 Difference]: Without dead ends: 11431 [2024-10-24 01:27:38,401 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-24 01:27:38,401 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 134 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:38,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 996 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11431 states. [2024-10-24 01:27:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11431 to 11429. [2024-10-24 01:27:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11429 states, 11428 states have (on average 1.7213860693034653) internal successors, (19672), 11428 states have internal predecessors, (19672), 0 states have call successors, (0), 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-24 01:27:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11429 states to 11429 states and 19672 transitions. [2024-10-24 01:27:38,594 INFO L78 Accepts]: Start accepts. Automaton has 11429 states and 19672 transitions. Word has length 121 [2024-10-24 01:27:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:38,594 INFO L471 AbstractCegarLoop]: Abstraction has 11429 states and 19672 transitions. [2024-10-24 01:27:38,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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-24 01:27:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 11429 states and 19672 transitions. [2024-10-24 01:27:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 01:27:38,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:38,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:38,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:27:38,596 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:38,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:38,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1517591948, now seen corresponding path program 1 times [2024-10-24 01:27:38,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:38,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771117990] [2024-10-24 01:27:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:38,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:38,742 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-24 01:27:38,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:38,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771117990] [2024-10-24 01:27:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771117990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:38,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:38,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:38,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225518431] [2024-10-24 01:27:38,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:38,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:38,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:38,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:38,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:38,744 INFO L87 Difference]: Start difference. First operand 11429 states and 19672 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 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-24 01:27:39,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:39,019 INFO L93 Difference]: Finished difference Result 37189 states and 64078 transitions. [2024-10-24 01:27:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:39,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-10-24 01:27:39,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:39,071 INFO L225 Difference]: With dead ends: 37189 [2024-10-24 01:27:39,072 INFO L226 Difference]: Without dead ends: 25989 [2024-10-24 01:27:39,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:39,093 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 505 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:39,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1521 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:39,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25989 states. [2024-10-24 01:27:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25989 to 18650. [2024-10-24 01:27:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18650 states, 18649 states have (on average 1.7127459917421846) internal successors, (31941), 18649 states have internal predecessors, (31941), 0 states have call successors, (0), 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-24 01:27:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18650 states to 18650 states and 31941 transitions. [2024-10-24 01:27:39,453 INFO L78 Accepts]: Start accepts. Automaton has 18650 states and 31941 transitions. Word has length 121 [2024-10-24 01:27:39,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:39,454 INFO L471 AbstractCegarLoop]: Abstraction has 18650 states and 31941 transitions. [2024-10-24 01:27:39,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 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-24 01:27:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 18650 states and 31941 transitions. [2024-10-24 01:27:39,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 01:27:39,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:39,455 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:39,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:27:39,455 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:39,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash -601127144, now seen corresponding path program 1 times [2024-10-24 01:27:39,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:39,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716033413] [2024-10-24 01:27:39,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:39,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:39,532 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-24 01:27:39,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716033413] [2024-10-24 01:27:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716033413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:39,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:39,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207976421] [2024-10-24 01:27:39,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:39,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:39,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:39,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:39,534 INFO L87 Difference]: Start difference. First operand 18650 states and 31941 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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-24 01:27:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:39,773 INFO L93 Difference]: Finished difference Result 36374 states and 62253 transitions. [2024-10-24 01:27:39,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:39,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-10-24 01:27:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:39,816 INFO L225 Difference]: With dead ends: 36374 [2024-10-24 01:27:39,816 INFO L226 Difference]: Without dead ends: 26147 [2024-10-24 01:27:39,833 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-24 01:27:39,834 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 141 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:39,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1030 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26147 states. [2024-10-24 01:27:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26147 to 26145. [2024-10-24 01:27:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26145 states, 26144 states have (on average 1.7000841493268053) internal successors, (44447), 26144 states have internal predecessors, (44447), 0 states have call successors, (0), 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-24 01:27:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26145 states to 26145 states and 44447 transitions. [2024-10-24 01:27:40,392 INFO L78 Accepts]: Start accepts. Automaton has 26145 states and 44447 transitions. Word has length 121 [2024-10-24 01:27:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:40,392 INFO L471 AbstractCegarLoop]: Abstraction has 26145 states and 44447 transitions. [2024-10-24 01:27:40,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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-24 01:27:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 26145 states and 44447 transitions. [2024-10-24 01:27:40,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 01:27:40,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:40,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:40,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:27:40,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:40,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:40,398 INFO L85 PathProgramCache]: Analyzing trace with hash 141989693, now seen corresponding path program 1 times [2024-10-24 01:27:40,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:40,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634784395] [2024-10-24 01:27:40,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:40,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:40,543 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-24 01:27:40,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:40,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634784395] [2024-10-24 01:27:40,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634784395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:40,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:40,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:40,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044377281] [2024-10-24 01:27:40,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:40,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:40,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:40,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:40,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:40,545 INFO L87 Difference]: Start difference. First operand 26145 states and 44447 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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-24 01:27:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:41,147 INFO L93 Difference]: Finished difference Result 85480 states and 145408 transitions. [2024-10-24 01:27:41,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:41,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-10-24 01:27:41,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:41,392 INFO L225 Difference]: With dead ends: 85480 [2024-10-24 01:27:41,392 INFO L226 Difference]: Without dead ends: 59549 [2024-10-24 01:27:41,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:41,437 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 503 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:41,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1523 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59549 states. [2024-10-24 01:27:42,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59549 to 42704. [2024-10-24 01:27:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42704 states, 42703 states have (on average 1.6901388661218182) internal successors, (72174), 42703 states have internal predecessors, (72174), 0 states have call successors, (0), 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-24 01:27:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42704 states to 42704 states and 72174 transitions. [2024-10-24 01:27:42,447 INFO L78 Accepts]: Start accepts. Automaton has 42704 states and 72174 transitions. Word has length 122 [2024-10-24 01:27:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:42,448 INFO L471 AbstractCegarLoop]: Abstraction has 42704 states and 72174 transitions. [2024-10-24 01:27:42,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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-24 01:27:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 42704 states and 72174 transitions. [2024-10-24 01:27:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 01:27:42,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:42,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:42,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:27:42,449 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:42,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:42,452 INFO L85 PathProgramCache]: Analyzing trace with hash 54864765, now seen corresponding path program 1 times [2024-10-24 01:27:42,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:42,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598520146] [2024-10-24 01:27:42,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:42,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:42,562 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-24 01:27:42,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:42,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598520146] [2024-10-24 01:27:42,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598520146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:42,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:42,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:42,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265626478] [2024-10-24 01:27:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:42,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:42,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:42,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:42,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:42,565 INFO L87 Difference]: Start difference. First operand 42704 states and 72174 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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-24 01:27:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:43,486 INFO L93 Difference]: Finished difference Result 138042 states and 233466 transitions. [2024-10-24 01:27:43,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:43,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-10-24 01:27:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:43,699 INFO L225 Difference]: With dead ends: 138042 [2024-10-24 01:27:43,699 INFO L226 Difference]: Without dead ends: 95552 [2024-10-24 01:27:43,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:43,753 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 501 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:43,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1508 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95552 states. [2024-10-24 01:27:44,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95552 to 68903. [2024-10-24 01:27:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68903 states, 68902 states have (on average 1.6805462831267597) internal successors, (115793), 68902 states have internal predecessors, (115793), 0 states have call successors, (0), 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-24 01:27:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68903 states to 68903 states and 115793 transitions. [2024-10-24 01:27:45,065 INFO L78 Accepts]: Start accepts. Automaton has 68903 states and 115793 transitions. Word has length 123 [2024-10-24 01:27:45,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:45,066 INFO L471 AbstractCegarLoop]: Abstraction has 68903 states and 115793 transitions. [2024-10-24 01:27:45,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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-24 01:27:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 68903 states and 115793 transitions. [2024-10-24 01:27:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 01:27:45,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:45,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:45,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:27:45,068 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:45,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash -291873627, now seen corresponding path program 1 times [2024-10-24 01:27:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:45,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296422875] [2024-10-24 01:27:45,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:45,551 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-24 01:27:45,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:45,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296422875] [2024-10-24 01:27:45,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296422875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:45,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:45,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:27:45,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786001058] [2024-10-24 01:27:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:45,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:27:45,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:45,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:27:45,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:27:45,554 INFO L87 Difference]: Start difference. First operand 68903 states and 115793 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 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-24 01:27:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:46,445 INFO L93 Difference]: Finished difference Result 137594 states and 231235 transitions. [2024-10-24 01:27:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:27:46,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-10-24 01:27:46,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:46,538 INFO L225 Difference]: With dead ends: 137594 [2024-10-24 01:27:46,538 INFO L226 Difference]: Without dead ends: 68905 [2024-10-24 01:27:46,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:27:46,585 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 405 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:46,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1784 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68905 states. [2024-10-24 01:27:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68905 to 68903. [2024-10-24 01:27:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68903 states, 68902 states have (on average 1.6714754288699893) internal successors, (115168), 68902 states have internal predecessors, (115168), 0 states have call successors, (0), 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-24 01:27:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68903 states to 68903 states and 115168 transitions. [2024-10-24 01:27:47,662 INFO L78 Accepts]: Start accepts. Automaton has 68903 states and 115168 transitions. Word has length 125 [2024-10-24 01:27:47,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:47,662 INFO L471 AbstractCegarLoop]: Abstraction has 68903 states and 115168 transitions. [2024-10-24 01:27:47,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 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-24 01:27:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 68903 states and 115168 transitions. [2024-10-24 01:27:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 01:27:47,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:47,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:47,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:27:47,664 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:47,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:47,664 INFO L85 PathProgramCache]: Analyzing trace with hash 605209050, now seen corresponding path program 1 times [2024-10-24 01:27:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:47,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714562766] [2024-10-24 01:27:47,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:47,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:48,133 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-24 01:27:48,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:48,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714562766] [2024-10-24 01:27:48,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714562766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:48,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:48,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:27:48,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234991008] [2024-10-24 01:27:48,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:48,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:27:48,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:48,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:27:48,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:27:48,135 INFO L87 Difference]: Start difference. First operand 68903 states and 115168 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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-24 01:27:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:49,451 INFO L93 Difference]: Finished difference Result 201512 states and 337223 transitions. [2024-10-24 01:27:49,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:27:49,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-10-24 01:27:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:49,636 INFO L225 Difference]: With dead ends: 201512 [2024-10-24 01:27:49,636 INFO L226 Difference]: Without dead ends: 132823 [2024-10-24 01:27:49,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:27:49,681 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 267 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:49,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1799 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:49,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132823 states. [2024-10-24 01:27:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132823 to 132821. [2024-10-24 01:27:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132821 states, 132820 states have (on average 1.6593058274356272) internal successors, (220389), 132820 states have internal predecessors, (220389), 0 states have call successors, (0), 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-24 01:27:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132821 states to 132821 states and 220389 transitions. [2024-10-24 01:27:52,038 INFO L78 Accepts]: Start accepts. Automaton has 132821 states and 220389 transitions. Word has length 128 [2024-10-24 01:27:52,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:52,039 INFO L471 AbstractCegarLoop]: Abstraction has 132821 states and 220389 transitions. [2024-10-24 01:27:52,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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-24 01:27:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 132821 states and 220389 transitions. [2024-10-24 01:27:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 01:27:52,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:52,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:52,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:27:52,040 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:52,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1567061276, now seen corresponding path program 1 times [2024-10-24 01:27:52,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:52,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994955705] [2024-10-24 01:27:52,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:52,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:52,364 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-24 01:27:52,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:52,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994955705] [2024-10-24 01:27:52,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994955705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:52,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:52,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:27:52,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277465189] [2024-10-24 01:27:52,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:52,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:27:52,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:52,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:27:52,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:27:52,365 INFO L87 Difference]: Start difference. First operand 132821 states and 220389 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:53,859 INFO L93 Difference]: Finished difference Result 136695 states and 226198 transitions. [2024-10-24 01:27:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:27:53,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2024-10-24 01:27:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:54,035 INFO L225 Difference]: With dead ends: 136695 [2024-10-24 01:27:54,035 INFO L226 Difference]: Without dead ends: 136693 [2024-10-24 01:27:54,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:27:54,059 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 0 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:54,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2349 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136693 states. [2024-10-24 01:27:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136693 to 136693. [2024-10-24 01:27:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136693 states, 136692 states have (on average 1.640432505194159) internal successors, (224234), 136692 states have internal predecessors, (224234), 0 states have call successors, (0), 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-24 01:27:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136693 states to 136693 states and 224234 transitions. [2024-10-24 01:27:56,335 INFO L78 Accepts]: Start accepts. Automaton has 136693 states and 224234 transitions. Word has length 129 [2024-10-24 01:27:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:56,335 INFO L471 AbstractCegarLoop]: Abstraction has 136693 states and 224234 transitions. [2024-10-24 01:27:56,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 136693 states and 224234 transitions. [2024-10-24 01:27:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 01:27:56,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:56,341 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:56,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:27:56,341 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:56,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:56,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1733509030, now seen corresponding path program 1 times [2024-10-24 01:27:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:56,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016579046] [2024-10-24 01:27:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:27:56,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:56,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016579046] [2024-10-24 01:27:56,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016579046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:56,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:56,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:27:56,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623944789] [2024-10-24 01:27:56,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:56,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:27:56,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:56,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:27:56,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:27:56,554 INFO L87 Difference]: Start difference. First operand 136693 states and 224234 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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-24 01:27:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:59,180 INFO L93 Difference]: Finished difference Result 376845 states and 619867 transitions. [2024-10-24 01:27:59,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:27:59,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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 164 [2024-10-24 01:27:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:59,677 INFO L225 Difference]: With dead ends: 376845 [2024-10-24 01:27:59,677 INFO L226 Difference]: Without dead ends: 315043 [2024-10-24 01:27:59,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:27:59,773 INFO L432 NwaCegarLoop]: 641 mSDtfsCounter, 1120 mSDsluCounter, 2128 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 2769 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:59,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 2769 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:59,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315043 states. [2024-10-24 01:28:03,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315043 to 220707. [2024-10-24 01:28:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220707 states, 220706 states have (on average 1.6371371870270859) internal successors, (361326), 220706 states have internal predecessors, (361326), 0 states have call successors, (0), 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-24 01:28:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220707 states to 220707 states and 361326 transitions. [2024-10-24 01:28:04,986 INFO L78 Accepts]: Start accepts. Automaton has 220707 states and 361326 transitions. Word has length 164 [2024-10-24 01:28:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:28:04,987 INFO L471 AbstractCegarLoop]: Abstraction has 220707 states and 361326 transitions. [2024-10-24 01:28:04,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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-24 01:28:04,987 INFO L276 IsEmpty]: Start isEmpty. Operand 220707 states and 361326 transitions. [2024-10-24 01:28:04,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 01:28:04,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:28:04,992 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:28:04,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:28:04,992 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:28:04,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:28:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash 189998796, now seen corresponding path program 1 times [2024-10-24 01:28:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:28:04,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572173096] [2024-10-24 01:28:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:28:04,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:28:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:28:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:28:05,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:28:05,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572173096] [2024-10-24 01:28:05,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572173096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:28:05,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:28:05,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:28:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237219719] [2024-10-24 01:28:05,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:28:05,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:28:05,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:28:05,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:28:05,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:28:05,219 INFO L87 Difference]: Start difference. First operand 220707 states and 361326 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 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-24 01:28:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:28:08,312 INFO L93 Difference]: Finished difference Result 424319 states and 697975 transitions. [2024-10-24 01:28:08,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:28:08,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 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 164 [2024-10-24 01:28:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:28:08,984 INFO L225 Difference]: With dead ends: 424319 [2024-10-24 01:28:08,984 INFO L226 Difference]: Without dead ends: 363667 [2024-10-24 01:28:09,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:28:09,105 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 1129 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:28:09,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 2703 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:28:09,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363667 states. [2024-10-24 01:28:14,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363667 to 299495. [2024-10-24 01:28:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299495 states, 299494 states have (on average 1.6381830687760022) internal successors, (490626), 299494 states have internal predecessors, (490626), 0 states have call successors, (0), 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-24 01:28:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299495 states to 299495 states and 490626 transitions. [2024-10-24 01:28:15,358 INFO L78 Accepts]: Start accepts. Automaton has 299495 states and 490626 transitions. Word has length 164 [2024-10-24 01:28:15,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:28:15,359 INFO L471 AbstractCegarLoop]: Abstraction has 299495 states and 490626 transitions. [2024-10-24 01:28:15,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 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-24 01:28:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 299495 states and 490626 transitions. [2024-10-24 01:28:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 01:28:15,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:28:15,365 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:28:15,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:28:15,365 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:28:15,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:28:15,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1282088972, now seen corresponding path program 1 times [2024-10-24 01:28:15,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:28:15,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175856545] [2024-10-24 01:28:15,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:28:15,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:28:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:28:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-24 01:28:15,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:28:15,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175856545] [2024-10-24 01:28:15,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175856545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:28:15,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:28:15,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:28:15,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835552711] [2024-10-24 01:28:15,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:28:15,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:28:15,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:28:15,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:28:15,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:28:15,557 INFO L87 Difference]: Start difference. First operand 299495 states and 490626 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)