./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/eca-rers2012/Problem16_label02.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 540d5c4f35934e1abeb0886e7556fb35e244ff515a3f2091d43a3a4e43fb5fb5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:45:04,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:45:04,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:45:04,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:45:04,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:45:04,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:45:04,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:45:04,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:45:04,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:45:04,569 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:45:04,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:45:04,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:45:04,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:45:04,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:45:04,572 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:45:04,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:45:04,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:45:04,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:45:04,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:45:04,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:45:04,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:45:04,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:45:04,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:45:04,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:45:04,576 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:45:04,577 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:45:04,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:45:04,577 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:45:04,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:45:04,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:45:04,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:45:04,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:45:04,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:45:04,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:45:04,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:45:04,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:45:04,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:45:04,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:45:04,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:45:04,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:45:04,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:45:04,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:45:04,581 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 -> 540d5c4f35934e1abeb0886e7556fb35e244ff515a3f2091d43a3a4e43fb5fb5 [2024-11-09 19:45:04,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:45:04,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:45:04,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:45:04,843 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:45:04,844 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:45:04,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label02.c [2024-11-09 19:45:06,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:45:06,570 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:45:06,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label02.c [2024-11-09 19:45:06,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4224466d/3492c5a3e3424f2c9756db5f991f32a6/FLAG8a799508b [2024-11-09 19:45:06,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4224466d/3492c5a3e3424f2c9756db5f991f32a6 [2024-11-09 19:45:06,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:45:06,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:45:06,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:45:06,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:45:06,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:45:06,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:45:06" (1/1) ... [2024-11-09 19:45:06,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cab377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:06, skipping insertion in model container [2024-11-09 19:45:06,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:45:06" (1/1) ... [2024-11-09 19:45:06,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:45:06,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label02.c[6387,6400] [2024-11-09 19:45:07,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:45:07,305 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:45:07,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label02.c[6387,6400] [2024-11-09 19:45:07,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:45:07,524 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:45:07,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:07 WrapperNode [2024-11-09 19:45:07,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:45:07,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:45:07,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:45:07,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:45:07,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:07" (1/1) ... [2024-11-09 19:45:07,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:07" (1/1) ... [2024-11-09 19:45:07,691 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1769 [2024-11-09 19:45:07,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:45:07,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:45:07,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:45:07,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:45:07,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:07" (1/1) ... [2024-11-09 19:45:07,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:07" (1/1) ... [2024-11-09 19:45:07,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:07" (1/1) ... [2024-11-09 19:45:07,780 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-11-09 19:45:07,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:07" (1/1) ... [2024-11-09 19:45:07,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:07" (1/1) ... [2024-11-09 19:45:07,819 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:07" (1/1) ... [2024-11-09 19:45:07,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:07" (1/1) ... [2024-11-09 19:45:07,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:07" (1/1) ... [2024-11-09 19:45:07,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:07" (1/1) ... [2024-11-09 19:45:07,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:45:07,863 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:45:07,864 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:45:07,864 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:45:07,864 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:07" (1/1) ... [2024-11-09 19:45:07,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:45:07,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:45:07,896 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-11-09 19:45:07,898 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-11-09 19:45:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:45:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:45:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:45:07,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:45:07,997 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:45:07,999 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:45:10,567 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2024-11-09 19:45:10,743 INFO L? ?]: Removed 757 outVars from TransFormulas that were not future-live. [2024-11-09 19:45:10,743 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:45:10,772 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:45:10,776 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:45:10,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:45:10 BoogieIcfgContainer [2024-11-09 19:45:10,776 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:45:10,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:45:10,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:45:10,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:45:10,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:45:06" (1/3) ... [2024-11-09 19:45:10,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a74e1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:45:10, skipping insertion in model container [2024-11-09 19:45:10,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:07" (2/3) ... [2024-11-09 19:45:10,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a74e1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:45:10, skipping insertion in model container [2024-11-09 19:45:10,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:45:10" (3/3) ... [2024-11-09 19:45:10,787 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label02.c [2024-11-09 19:45:10,805 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:45:10,805 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:45:10,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:45:10,899 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;@3fa65261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:45:10,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:45:10,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 397 states have (on average 2.4886649874055418) internal successors, (988), 398 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:10,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 19:45:10,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:10,918 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] [2024-11-09 19:45:10,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:10,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:10,925 INFO L85 PathProgramCache]: Analyzing trace with hash -736725295, now seen corresponding path program 1 times [2024-11-09 19:45:10,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:10,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249975015] [2024-11-09 19:45:10,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:10,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:45:11,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:11,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249975015] [2024-11-09 19:45:11,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249975015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:45:11,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:45:11,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:45:11,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654698714] [2024-11-09 19:45:11,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:45:11,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:45:11,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:45:11,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:45:11,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:45:11,489 INFO L87 Difference]: Start difference. First operand has 399 states, 397 states have (on average 2.4886649874055418) internal successors, (988), 398 states have internal predecessors, (988), 0 states have call successors, (0), 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 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:45:15,287 INFO L93 Difference]: Finished difference Result 1463 states and 3819 transitions. [2024-11-09 19:45:15,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:45:15,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-09 19:45:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:45:15,317 INFO L225 Difference]: With dead ends: 1463 [2024-11-09 19:45:15,319 INFO L226 Difference]: Without dead ends: 995 [2024-11-09 19:45:15,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:45:15,329 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 1698 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 3485 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1698 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 3994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 3485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:45:15,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1698 Valid, 354 Invalid, 3994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 3485 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:45:15,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2024-11-09 19:45:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2024-11-09 19:45:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 2.2746478873239435) internal successors, (2261), 994 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2261 transitions. [2024-11-09 19:45:15,448 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2261 transitions. Word has length 63 [2024-11-09 19:45:15,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:45:15,449 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 2261 transitions. [2024-11-09 19:45:15,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2261 transitions. [2024-11-09 19:45:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 19:45:15,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:15,455 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 19:45:15,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:45:15,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:15,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:15,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1954145038, now seen corresponding path program 1 times [2024-11-09 19:45:15,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:15,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433853482] [2024-11-09 19:45:15,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:15,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:45:15,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:15,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433853482] [2024-11-09 19:45:15,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433853482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:45:15,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452121135] [2024-11-09 19:45:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:15,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:45:15,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:45:15,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:45:15,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:45:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:15,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 19:45:15,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:45:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:45:16,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:45:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:45:16,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452121135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:45:16,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:45:16,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-09 19:45:16,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112908881] [2024-11-09 19:45:16,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:45:16,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 19:45:16,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:45:16,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 19:45:16,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:45:16,585 INFO L87 Difference]: Start difference. First operand 995 states and 2261 transitions. Second operand has 6 states, 6 states have (on average 50.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:22,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:45:22,939 INFO L93 Difference]: Finished difference Result 6278 states and 15487 transitions. [2024-11-09 19:45:22,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 19:45:22,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 50.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2024-11-09 19:45:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:45:22,964 INFO L225 Difference]: With dead ends: 6278 [2024-11-09 19:45:22,964 INFO L226 Difference]: Without dead ends: 5615 [2024-11-09 19:45:22,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 19:45:22,967 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6408 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4826 mSolverCounterSat, 3096 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6408 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 7922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3096 IncrementalHoareTripleChecker+Valid, 4826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:45:22,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6408 Valid, 38 Invalid, 7922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3096 Valid, 4826 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-09 19:45:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5615 states. [2024-11-09 19:45:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5615 to 5615. [2024-11-09 19:45:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5615 states, 5614 states have (on average 2.334698966868543) internal successors, (13107), 5614 states have internal predecessors, (13107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 13107 transitions. [2024-11-09 19:45:23,129 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 13107 transitions. Word has length 151 [2024-11-09 19:45:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:45:23,131 INFO L471 AbstractCegarLoop]: Abstraction has 5615 states and 13107 transitions. [2024-11-09 19:45:23,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 13107 transitions. [2024-11-09 19:45:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-09 19:45:23,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:23,140 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:45:23,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:45:23,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:45:23,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:23,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:23,345 INFO L85 PathProgramCache]: Analyzing trace with hash 568599076, now seen corresponding path program 1 times [2024-11-09 19:45:23,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:23,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833738268] [2024-11-09 19:45:23,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:23,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2024-11-09 19:45:23,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:23,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833738268] [2024-11-09 19:45:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833738268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:45:23,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:45:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:45:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096733325] [2024-11-09 19:45:23,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:45:23,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:45:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:45:23,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:45:23,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:45:23,622 INFO L87 Difference]: Start difference. First operand 5615 states and 13107 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:45:25,279 INFO L93 Difference]: Finished difference Result 12548 states and 29288 transitions. [2024-11-09 19:45:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:45:25,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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 309 [2024-11-09 19:45:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:45:25,302 INFO L225 Difference]: With dead ends: 12548 [2024-11-09 19:45:25,302 INFO L226 Difference]: Without dead ends: 7265 [2024-11-09 19:45:25,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:45:25,310 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 570 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:45:25,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 80 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 19:45:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7265 states. [2024-11-09 19:45:25,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7265 to 7265. [2024-11-09 19:45:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7265 states, 7264 states have (on average 2.2011288546255505) internal successors, (15989), 7264 states have internal predecessors, (15989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7265 states to 7265 states and 15989 transitions. [2024-11-09 19:45:25,457 INFO L78 Accepts]: Start accepts. Automaton has 7265 states and 15989 transitions. Word has length 309 [2024-11-09 19:45:25,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:45:25,457 INFO L471 AbstractCegarLoop]: Abstraction has 7265 states and 15989 transitions. [2024-11-09 19:45:25,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:25,458 INFO L276 IsEmpty]: Start isEmpty. Operand 7265 states and 15989 transitions. [2024-11-09 19:45:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-09 19:45:25,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:25,465 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 19:45:25,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:45:25,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:25,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1519204876, now seen corresponding path program 1 times [2024-11-09 19:45:25,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:25,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084308779] [2024-11-09 19:45:25,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:25,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-09 19:45:25,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:25,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084308779] [2024-11-09 19:45:25,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084308779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:45:25,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:45:25,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:45:25,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935804285] [2024-11-09 19:45:25,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:45:25,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:45:25,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:45:25,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:45:25,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:45:25,840 INFO L87 Difference]: Start difference. First operand 7265 states and 15989 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:27,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:45:27,438 INFO L93 Difference]: Finished difference Result 18158 states and 40086 transitions. [2024-11-09 19:45:27,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:45:27,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2024-11-09 19:45:27,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:45:27,473 INFO L225 Difference]: With dead ends: 18158 [2024-11-09 19:45:27,474 INFO L226 Difference]: Without dead ends: 11225 [2024-11-09 19:45:27,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:45:27,486 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 577 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:45:27,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 158 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:45:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11225 states. [2024-11-09 19:45:27,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11225 to 9575. [2024-11-09 19:45:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9575 states, 9574 states have (on average 2.0611029872571547) internal successors, (19733), 9574 states have internal predecessors, (19733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9575 states to 9575 states and 19733 transitions. [2024-11-09 19:45:27,722 INFO L78 Accepts]: Start accepts. Automaton has 9575 states and 19733 transitions. Word has length 355 [2024-11-09 19:45:27,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:45:27,722 INFO L471 AbstractCegarLoop]: Abstraction has 9575 states and 19733 transitions. [2024-11-09 19:45:27,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 9575 states and 19733 transitions. [2024-11-09 19:45:27,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2024-11-09 19:45:27,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:27,732 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 19:45:27,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:45:27,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:27,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:27,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1508042372, now seen corresponding path program 1 times [2024-11-09 19:45:27,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:27,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319035984] [2024-11-09 19:45:27,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:27,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 413 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 19:45:28,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:28,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319035984] [2024-11-09 19:45:28,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319035984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:45:28,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:45:28,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:45:28,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515263201] [2024-11-09 19:45:28,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:45:28,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:45:28,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:45:28,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:45:28,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:45:28,028 INFO L87 Difference]: Start difference. First operand 9575 states and 19733 transitions. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:29,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:45:29,717 INFO L93 Difference]: Finished difference Result 20468 states and 42042 transitions. [2024-11-09 19:45:29,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:45:29,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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 451 [2024-11-09 19:45:29,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:45:29,740 INFO L225 Difference]: With dead ends: 20468 [2024-11-09 19:45:29,740 INFO L226 Difference]: Without dead ends: 9575 [2024-11-09 19:45:29,753 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-11-09 19:45:29,754 INFO L432 NwaCegarLoop]: 798 mSDtfsCounter, 528 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:45:29,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 804 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:45:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9575 states. [2024-11-09 19:45:29,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9575 to 8915. [2024-11-09 19:45:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8915 states, 8914 states have (on average 1.8702041732106798) internal successors, (16671), 8914 states have internal predecessors, (16671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8915 states to 8915 states and 16671 transitions. [2024-11-09 19:45:29,894 INFO L78 Accepts]: Start accepts. Automaton has 8915 states and 16671 transitions. Word has length 451 [2024-11-09 19:45:29,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:45:29,894 INFO L471 AbstractCegarLoop]: Abstraction has 8915 states and 16671 transitions. [2024-11-09 19:45:29,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8915 states and 16671 transitions. [2024-11-09 19:45:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2024-11-09 19:45:29,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:29,906 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 19:45:29,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:45:29,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:29,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:29,908 INFO L85 PathProgramCache]: Analyzing trace with hash 805904216, now seen corresponding path program 1 times [2024-11-09 19:45:29,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:29,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594662737] [2024-11-09 19:45:29,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:29,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 493 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 19:45:30,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:30,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594662737] [2024-11-09 19:45:30,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594662737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:45:30,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:45:30,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:45:30,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842887820] [2024-11-09 19:45:30,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:45:30,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:45:30,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:45:30,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:45:30,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:45:30,366 INFO L87 Difference]: Start difference. First operand 8915 states and 16671 transitions. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:45:31,716 INFO L93 Difference]: Finished difference Result 23768 states and 44507 transitions. [2024-11-09 19:45:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:45:31,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 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 567 [2024-11-09 19:45:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:45:31,746 INFO L225 Difference]: With dead ends: 23768 [2024-11-09 19:45:31,746 INFO L226 Difference]: Without dead ends: 15185 [2024-11-09 19:45:31,755 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-11-09 19:45:31,756 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 449 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:45:31,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 76 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:45:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15185 states. [2024-11-09 19:45:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15185 to 14855. [2024-11-09 19:45:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14855 states, 14854 states have (on average 1.8612494950854988) internal successors, (27647), 14854 states have internal predecessors, (27647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14855 states to 14855 states and 27647 transitions. [2024-11-09 19:45:31,970 INFO L78 Accepts]: Start accepts. Automaton has 14855 states and 27647 transitions. Word has length 567 [2024-11-09 19:45:31,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:45:31,971 INFO L471 AbstractCegarLoop]: Abstraction has 14855 states and 27647 transitions. [2024-11-09 19:45:31,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 14855 states and 27647 transitions. [2024-11-09 19:45:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2024-11-09 19:45:31,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:31,989 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:45:31,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:45:31,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:31,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:31,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2030870319, now seen corresponding path program 1 times [2024-11-09 19:45:31,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:31,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140859148] [2024-11-09 19:45:31,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:31,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 579 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-09 19:45:32,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:32,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140859148] [2024-11-09 19:45:32,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140859148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:45:32,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:45:32,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:45:32,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828339612] [2024-11-09 19:45:32,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:45:32,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:45:32,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:45:32,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:45:32,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:45:32,659 INFO L87 Difference]: Start difference. First operand 14855 states and 27647 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 2 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:34,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:45:34,035 INFO L93 Difference]: Finished difference Result 32018 states and 59622 transitions. [2024-11-09 19:45:34,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:45:34,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 2 states have internal predecessors, (403), 0 states have call successors, (0), 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 664 [2024-11-09 19:45:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:45:34,063 INFO L225 Difference]: With dead ends: 32018 [2024-11-09 19:45:34,063 INFO L226 Difference]: Without dead ends: 17495 [2024-11-09 19:45:34,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:45:34,076 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 359 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:45:34,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 71 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:45:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17495 states. [2024-11-09 19:45:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17495 to 17495. [2024-11-09 19:45:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17495 states, 17494 states have (on average 1.8587515719675318) internal successors, (32517), 17494 states have internal predecessors, (32517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17495 states to 17495 states and 32517 transitions. [2024-11-09 19:45:34,333 INFO L78 Accepts]: Start accepts. Automaton has 17495 states and 32517 transitions. Word has length 664 [2024-11-09 19:45:34,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:45:34,334 INFO L471 AbstractCegarLoop]: Abstraction has 17495 states and 32517 transitions. [2024-11-09 19:45:34,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 2 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:34,334 INFO L276 IsEmpty]: Start isEmpty. Operand 17495 states and 32517 transitions. [2024-11-09 19:45:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2024-11-09 19:45:34,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:34,347 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:45:34,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:45:34,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:34,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash -148178759, now seen corresponding path program 1 times [2024-11-09 19:45:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:34,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143205034] [2024-11-09 19:45:34,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:34,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 747 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-09 19:45:34,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:34,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143205034] [2024-11-09 19:45:34,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143205034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:45:34,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:45:34,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:45:34,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158539711] [2024-11-09 19:45:34,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:45:34,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:45:34,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:45:34,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:45:34,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:45:34,892 INFO L87 Difference]: Start difference. First operand 17495 states and 32517 transitions. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:45:36,112 INFO L93 Difference]: Finished difference Result 37628 states and 69949 transitions. [2024-11-09 19:45:36,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:45:36,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 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 672 [2024-11-09 19:45:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:45:36,137 INFO L225 Difference]: With dead ends: 37628 [2024-11-09 19:45:36,137 INFO L226 Difference]: Without dead ends: 20795 [2024-11-09 19:45:36,151 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-11-09 19:45:36,152 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 454 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:45:36,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 49 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:45:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20795 states. [2024-11-09 19:45:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20795 to 20135. [2024-11-09 19:45:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20135 states, 20134 states have (on average 1.854773020760902) internal successors, (37344), 20134 states have internal predecessors, (37344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20135 states to 20135 states and 37344 transitions. [2024-11-09 19:45:36,514 INFO L78 Accepts]: Start accepts. Automaton has 20135 states and 37344 transitions. Word has length 672 [2024-11-09 19:45:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:45:36,515 INFO L471 AbstractCegarLoop]: Abstraction has 20135 states and 37344 transitions. [2024-11-09 19:45:36,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 20135 states and 37344 transitions. [2024-11-09 19:45:36,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 721 [2024-11-09 19:45:36,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:36,527 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:45:36,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:45:36,528 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:36,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1070077355, now seen corresponding path program 1 times [2024-11-09 19:45:36,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:36,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737583642] [2024-11-09 19:45:36,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:36,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 600 proven. 102 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-09 19:45:37,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:37,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737583642] [2024-11-09 19:45:37,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737583642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:45:37,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70421378] [2024-11-09 19:45:37,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:37,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:45:37,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:45:37,948 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:45:37,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:45:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:38,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 19:45:38,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:45:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 702 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-09 19:45:39,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:45:39,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70421378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:45:39,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:45:39,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 19:45:39,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788949154] [2024-11-09 19:45:39,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:45:39,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:45:39,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:45:39,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:45:39,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:45:39,181 INFO L87 Difference]: Start difference. First operand 20135 states and 37344 transitions. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:45:40,646 INFO L93 Difference]: Finished difference Result 41918 states and 77734 transitions. [2024-11-09 19:45:40,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:45:40,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 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 720 [2024-11-09 19:45:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:45:40,670 INFO L225 Difference]: With dead ends: 41918 [2024-11-09 19:45:40,671 INFO L226 Difference]: Without dead ends: 22445 [2024-11-09 19:45:40,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:45:40,684 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 348 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:45:40,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 100 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:45:40,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22445 states. [2024-11-09 19:45:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22445 to 19145. [2024-11-09 19:45:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19145 states, 19144 states have (on average 1.8494045131633932) internal successors, (35405), 19144 states have internal predecessors, (35405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19145 states to 19145 states and 35405 transitions. [2024-11-09 19:45:40,985 INFO L78 Accepts]: Start accepts. Automaton has 19145 states and 35405 transitions. Word has length 720 [2024-11-09 19:45:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:45:40,986 INFO L471 AbstractCegarLoop]: Abstraction has 19145 states and 35405 transitions. [2024-11-09 19:45:40,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 19145 states and 35405 transitions. [2024-11-09 19:45:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2024-11-09 19:45:40,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:40,999 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:45:41,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 19:45:41,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-09 19:45:41,200 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:41,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:41,201 INFO L85 PathProgramCache]: Analyzing trace with hash -25766509, now seen corresponding path program 1 times [2024-11-09 19:45:41,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:41,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736477262] [2024-11-09 19:45:41,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:41,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 521 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-09 19:45:41,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:41,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736477262] [2024-11-09 19:45:41,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736477262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:45:41,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:45:41,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:45:41,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849579807] [2024-11-09 19:45:41,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:45:41,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:45:41,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:45:41,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:45:41,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:45:41,676 INFO L87 Difference]: Start difference. First operand 19145 states and 35405 transitions. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:45:43,122 INFO L93 Difference]: Finished difference Result 42578 states and 78736 transitions. [2024-11-09 19:45:43,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:45:43,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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 728 [2024-11-09 19:45:43,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:45:43,148 INFO L225 Difference]: With dead ends: 42578 [2024-11-09 19:45:43,148 INFO L226 Difference]: Without dead ends: 23435 [2024-11-09 19:45:43,155 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-11-09 19:45:43,156 INFO L432 NwaCegarLoop]: 701 mSDtfsCounter, 487 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:45:43,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 709 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:45:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23435 states. [2024-11-09 19:45:43,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23435 to 21125. [2024-11-09 19:45:43,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21125 states, 21124 states have (on average 1.8430221548949062) internal successors, (38932), 21124 states have internal predecessors, (38932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21125 states to 21125 states and 38932 transitions. [2024-11-09 19:45:43,388 INFO L78 Accepts]: Start accepts. Automaton has 21125 states and 38932 transitions. Word has length 728 [2024-11-09 19:45:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:45:43,389 INFO L471 AbstractCegarLoop]: Abstraction has 21125 states and 38932 transitions. [2024-11-09 19:45:43,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:43,389 INFO L276 IsEmpty]: Start isEmpty. Operand 21125 states and 38932 transitions. [2024-11-09 19:45:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2024-11-09 19:45:43,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:43,402 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:45:43,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:45:43,402 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:43,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1997609243, now seen corresponding path program 1 times [2024-11-09 19:45:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:43,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853090083] [2024-11-09 19:45:43,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2024-11-09 19:45:44,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:44,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853090083] [2024-11-09 19:45:44,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853090083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:45:44,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:45:44,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:45:44,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242039752] [2024-11-09 19:45:44,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:45:44,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:45:44,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:45:44,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:45:44,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:45:44,686 INFO L87 Difference]: Start difference. First operand 21125 states and 38932 transitions. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:45:46,699 INFO L93 Difference]: Finished difference Result 23111 states and 42536 transitions. [2024-11-09 19:45:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:45:46,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 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 785 [2024-11-09 19:45:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:45:46,725 INFO L225 Difference]: With dead ends: 23111 [2024-11-09 19:45:46,725 INFO L226 Difference]: Without dead ends: 22778 [2024-11-09 19:45:46,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:45:46,732 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 1030 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 2629 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:45:46,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 29 Invalid, 2739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2629 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:45:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22778 states. [2024-11-09 19:45:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22778 to 21125. [2024-11-09 19:45:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21125 states, 21124 states have (on average 1.8428327968187843) internal successors, (38928), 21124 states have internal predecessors, (38928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21125 states to 21125 states and 38928 transitions. [2024-11-09 19:45:46,944 INFO L78 Accepts]: Start accepts. Automaton has 21125 states and 38928 transitions. Word has length 785 [2024-11-09 19:45:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:45:46,944 INFO L471 AbstractCegarLoop]: Abstraction has 21125 states and 38928 transitions. [2024-11-09 19:45:46,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 21125 states and 38928 transitions. [2024-11-09 19:45:46,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2024-11-09 19:45:46,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:46,958 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:45:46,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:45:46,958 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:46,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:46,959 INFO L85 PathProgramCache]: Analyzing trace with hash -664149372, now seen corresponding path program 1 times [2024-11-09 19:45:46,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:46,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283246780] [2024-11-09 19:45:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:46,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2024-11-09 19:45:48,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:48,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283246780] [2024-11-09 19:45:48,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283246780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:45:48,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:45:48,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:45:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341550537] [2024-11-09 19:45:48,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:45:48,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:45:48,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:45:48,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:45:48,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:45:48,283 INFO L87 Difference]: Start difference. First operand 21125 states and 38928 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:45:49,553 INFO L93 Difference]: Finished difference Result 41918 states and 77260 transitions. [2024-11-09 19:45:49,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:45:49,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 826 [2024-11-09 19:45:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:45:49,581 INFO L225 Difference]: With dead ends: 41918 [2024-11-09 19:45:49,581 INFO L226 Difference]: Without dead ends: 21125 [2024-11-09 19:45:49,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:45:49,596 INFO L432 NwaCegarLoop]: 641 mSDtfsCounter, 568 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:45:49,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 649 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:45:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21125 states. [2024-11-09 19:45:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21125 to 21125. [2024-11-09 19:45:49,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21125 states, 21124 states have (on average 1.8370100359780344) internal successors, (38805), 21124 states have internal predecessors, (38805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21125 states to 21125 states and 38805 transitions. [2024-11-09 19:45:49,776 INFO L78 Accepts]: Start accepts. Automaton has 21125 states and 38805 transitions. Word has length 826 [2024-11-09 19:45:49,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:45:49,777 INFO L471 AbstractCegarLoop]: Abstraction has 21125 states and 38805 transitions. [2024-11-09 19:45:49,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 21125 states and 38805 transitions. [2024-11-09 19:45:49,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2024-11-09 19:45:49,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:49,786 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:45:49,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:45:49,786 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:49,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:49,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1100367480, now seen corresponding path program 1 times [2024-11-09 19:45:49,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:49,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437014778] [2024-11-09 19:45:49,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:49,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 841 proven. 156 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2024-11-09 19:45:51,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:51,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437014778] [2024-11-09 19:45:51,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437014778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:45:51,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238437919] [2024-11-09 19:45:51,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:51,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:45:51,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:45:51,054 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:45:51,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:45:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:51,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:45:51,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:45:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 960 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2024-11-09 19:45:51,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:45:51,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238437919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:45:51,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:45:51,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 19:45:51,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588477663] [2024-11-09 19:45:51,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:45:51,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:45:51,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:45:51,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:45:51,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:45:51,603 INFO L87 Difference]: Start difference. First operand 21125 states and 38805 transitions. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:52,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:45:52,757 INFO L93 Difference]: Finished difference Result 41918 states and 77014 transitions. [2024-11-09 19:45:52,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:45:52,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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 830 [2024-11-09 19:45:52,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:45:52,780 INFO L225 Difference]: With dead ends: 41918 [2024-11-09 19:45:52,780 INFO L226 Difference]: Without dead ends: 21125 [2024-11-09 19:45:52,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 829 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:45:52,791 INFO L432 NwaCegarLoop]: 690 mSDtfsCounter, 427 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:45:52,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 698 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:45:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21125 states. [2024-11-09 19:45:52,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21125 to 20465. [2024-11-09 19:45:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20465 states, 20464 states have (on average 1.8316555903049256) internal successors, (37483), 20464 states have internal predecessors, (37483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20465 states to 20465 states and 37483 transitions. [2024-11-09 19:45:52,975 INFO L78 Accepts]: Start accepts. Automaton has 20465 states and 37483 transitions. Word has length 830 [2024-11-09 19:45:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:45:52,976 INFO L471 AbstractCegarLoop]: Abstraction has 20465 states and 37483 transitions. [2024-11-09 19:45:52,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 20465 states and 37483 transitions. [2024-11-09 19:45:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 874 [2024-11-09 19:45:52,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:52,987 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:45:52,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 19:45:53,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:45:53,188 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:53,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1938303965, now seen corresponding path program 1 times [2024-11-09 19:45:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:53,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803785883] [2024-11-09 19:45:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:53,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 637 proven. 147 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2024-11-09 19:45:54,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:54,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803785883] [2024-11-09 19:45:54,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803785883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:45:54,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802695273] [2024-11-09 19:45:54,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:54,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:45:54,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:45:54,151 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:45:54,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 19:45:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:54,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:45:54,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:45:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 784 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2024-11-09 19:45:54,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:45:54,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802695273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:45:54,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:45:54,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-09 19:45:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046676511] [2024-11-09 19:45:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:45:54,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:45:54,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:45:54,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:45:54,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 19:45:54,649 INFO L87 Difference]: Start difference. First operand 20465 states and 37483 transitions. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:55,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:45:55,878 INFO L93 Difference]: Finished difference Result 43898 states and 80410 transitions. [2024-11-09 19:45:55,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:45:55,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 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 873 [2024-11-09 19:45:55,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:45:55,911 INFO L225 Difference]: With dead ends: 43898 [2024-11-09 19:45:55,911 INFO L226 Difference]: Without dead ends: 23765 [2024-11-09 19:45:55,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 19:45:55,927 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 406 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:45:55,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 110 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:45:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23765 states. [2024-11-09 19:45:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23765 to 22775. [2024-11-09 19:45:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22775 states, 22774 states have (on average 1.8298498287520857) internal successors, (41673), 22774 states have internal predecessors, (41673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22775 states to 22775 states and 41673 transitions. [2024-11-09 19:45:56,163 INFO L78 Accepts]: Start accepts. Automaton has 22775 states and 41673 transitions. Word has length 873 [2024-11-09 19:45:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:45:56,164 INFO L471 AbstractCegarLoop]: Abstraction has 22775 states and 41673 transitions. [2024-11-09 19:45:56,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:45:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 22775 states and 41673 transitions. [2024-11-09 19:45:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2024-11-09 19:45:56,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:45:56,174 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:45:56,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 19:45:56,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:45:56,375 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:45:56,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:45:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1476292777, now seen corresponding path program 1 times [2024-11-09 19:45:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:45:56,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723577323] [2024-11-09 19:45:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:45:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:57,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1328 backedges. 949 proven. 100 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-11-09 19:45:57,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:45:57,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723577323] [2024-11-09 19:45:57,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723577323] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:45:57,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009026303] [2024-11-09 19:45:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:45:57,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:45:57,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:45:57,509 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:45:57,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 19:45:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:45:57,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 19:45:57,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:46:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1328 backedges. 251 proven. 858 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-11-09 19:46:00,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:46:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1328 backedges. 311 proven. 798 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-11-09 19:46:02,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009026303] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:46:02,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:46:02,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 12 [2024-11-09 19:46:02,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920675165] [2024-11-09 19:46:02,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:46:02,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 19:46:02,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:46:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 19:46:02,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-09 19:46:02,728 INFO L87 Difference]: Start difference. First operand 22775 states and 41673 transitions. Second operand has 13 states, 13 states have (on average 118.76923076923077) internal successors, (1544), 12 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:46:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:46:14,406 INFO L93 Difference]: Finished difference Result 56456 states and 103207 transitions. [2024-11-09 19:46:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 19:46:14,407 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 118.76923076923077) internal successors, (1544), 12 states have internal predecessors, (1544), 0 states have call successors, (0), 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 875 [2024-11-09 19:46:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:46:14,449 INFO L225 Difference]: With dead ends: 56456 [2024-11-09 19:46:14,450 INFO L226 Difference]: Without dead ends: 33023 [2024-11-09 19:46:14,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1764 GetRequests, 1741 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2024-11-09 19:46:14,457 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 9082 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 19893 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9082 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 20364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 19893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:46:14,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9082 Valid, 174 Invalid, 20364 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [471 Valid, 19893 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2024-11-09 19:46:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33023 states. [2024-11-09 19:46:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33023 to 27065. [2024-11-09 19:46:14,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27065 states, 27064 states have (on average 1.8273352054389596) internal successors, (49455), 27064 states have internal predecessors, (49455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:46:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27065 states to 27065 states and 49455 transitions. [2024-11-09 19:46:14,729 INFO L78 Accepts]: Start accepts. Automaton has 27065 states and 49455 transitions. Word has length 875 [2024-11-09 19:46:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:46:14,729 INFO L471 AbstractCegarLoop]: Abstraction has 27065 states and 49455 transitions. [2024-11-09 19:46:14,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 118.76923076923077) internal successors, (1544), 12 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:46:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 27065 states and 49455 transitions. [2024-11-09 19:46:14,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1018 [2024-11-09 19:46:14,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:46:14,743 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-11-09 19:46:14,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 19:46:14,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 19:46:14,944 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:46:14,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:46:14,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1784037807, now seen corresponding path program 1 times [2024-11-09 19:46:14,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:46:14,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007217827] [2024-11-09 19:46:14,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:46:14,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:46:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:46:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 1203 proven. 115 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-11-09 19:46:15,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:46:15,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007217827] [2024-11-09 19:46:15,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007217827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:46:15,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482090972] [2024-11-09 19:46:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:46:15,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:46:15,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:46:15,823 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:46:15,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 19:46:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:46:16,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 19:46:16,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:46:17,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 1203 proven. 115 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-11-09 19:46:17,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:46:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 1203 proven. 115 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-11-09 19:46:19,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482090972] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:46:19,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:46:19,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-09 19:46:19,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502308751] [2024-11-09 19:46:19,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:46:19,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 19:46:19,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:46:19,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 19:46:19,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:46:19,033 INFO L87 Difference]: Start difference. First operand 27065 states and 49455 transitions. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)