./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label17.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae22f3f06aabed24b98a90f87729aaa6479f5932deb24c738c216ff13229105f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:45:57,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:45:57,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:45:57,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:45:57,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:45:57,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:45:57,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:45:58,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:45:58,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:45:58,001 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:45:58,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:45:58,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:45:58,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:45:58,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:45:58,007 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:45:58,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:45:58,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:45:58,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:45:58,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:45:58,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:45:58,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:45:58,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:45:58,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:45:58,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:45:58,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:45:58,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:45:58,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:45:58,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:45:58,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:45:58,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:45:58,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:45:58,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:45:58,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:45:58,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:45:58,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:45:58,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:45:58,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:45:58,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:45:58,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:45:58,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:45:58,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:45:58,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:45:58,020 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae22f3f06aabed24b98a90f87729aaa6479f5932deb24c738c216ff13229105f [2024-10-10 23:45:58,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:45:58,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:45:58,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:45:58,325 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:45:58,327 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:45:58,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label17.c [2024-10-10 23:45:59,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:46:00,206 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:46:00,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label17.c [2024-10-10 23:46:00,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e8c01bb7e/e8e9d13993df46ee8c2aa8939fb97911/FLAG46b5ebd42 [2024-10-10 23:46:00,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e8c01bb7e/e8e9d13993df46ee8c2aa8939fb97911 [2024-10-10 23:46:00,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:46:00,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:46:00,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:46:00,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:46:00,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:46:00,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:46:00" (1/1) ... [2024-10-10 23:46:00,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc282f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:00, skipping insertion in model container [2024-10-10 23:46:00,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:46:00" (1/1) ... [2024-10-10 23:46:00,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:46:00,743 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label17.c[5781,5794] [2024-10-10 23:46:01,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:46:01,301 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:46:01,325 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label17.c[5781,5794] [2024-10-10 23:46:01,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:46:01,577 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:46:01,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:01 WrapperNode [2024-10-10 23:46:01,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:46:01,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:46:01,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:46:01,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:46:01,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:01" (1/1) ... [2024-10-10 23:46:01,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:01" (1/1) ... [2024-10-10 23:46:01,912 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:46:01,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:46:01,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:46:01,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:46:01,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:46:01,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:01" (1/1) ... [2024-10-10 23:46:01,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:01" (1/1) ... [2024-10-10 23:46:01,961 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:01" (1/1) ... [2024-10-10 23:46:02,125 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:46:02,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:01" (1/1) ... [2024-10-10 23:46:02,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:01" (1/1) ... [2024-10-10 23:46:02,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:01" (1/1) ... [2024-10-10 23:46:02,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:01" (1/1) ... [2024-10-10 23:46:02,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:01" (1/1) ... [2024-10-10 23:46:02,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:01" (1/1) ... [2024-10-10 23:46:02,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:46:02,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:46:02,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:46:02,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:46:02,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:01" (1/1) ... [2024-10-10 23:46:02,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:46:02,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:46:02,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:46:02,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:46:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:46:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:46:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:46:02,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:46:02,515 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:46:02,516 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:46:05,644 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:46:05,645 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:46:05,699 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:46:05,699 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:46:05,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:46:05 BoogieIcfgContainer [2024-10-10 23:46:05,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:46:05,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:46:05,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:46:05,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:46:05,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:46:00" (1/3) ... [2024-10-10 23:46:05,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31422205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:46:05, skipping insertion in model container [2024-10-10 23:46:05,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:01" (2/3) ... [2024-10-10 23:46:05,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31422205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:46:05, skipping insertion in model container [2024-10-10 23:46:05,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:46:05" (3/3) ... [2024-10-10 23:46:05,711 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label17.c [2024-10-10 23:46:05,727 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:46:05,728 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:46:05,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:46:05,822 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;@43b4ed1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:46:05,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:46:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-10 23:46:05,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:05,838 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] [2024-10-10 23:46:05,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:05,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:05,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1085236465, now seen corresponding path program 1 times [2024-10-10 23:46:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:05,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142929175] [2024-10-10 23:46:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:06,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:06,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142929175] [2024-10-10 23:46:06,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142929175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:06,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:06,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:06,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705340333] [2024-10-10 23:46:06,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:06,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:46:06,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:06,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:46:06,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:46:06,065 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:06,191 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:46:06,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:46:06,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-10-10 23:46:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:06,220 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:46:06,221 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:46:06,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:46:06,233 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:06,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:46:06,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:46:06,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:46:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:46:06,304 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 37 [2024-10-10 23:46:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:06,305 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:46:06,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:46:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-10 23:46:06,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:06,306 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] [2024-10-10 23:46:06,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:46:06,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:06,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:06,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1566685714, now seen corresponding path program 1 times [2024-10-10 23:46:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:06,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823123930] [2024-10-10 23:46:06,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:06,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:06,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:06,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823123930] [2024-10-10 23:46:06,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823123930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:06,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:06,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:06,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110237502] [2024-10-10 23:46:06,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:06,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:06,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:06,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:06,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:06,505 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:08,801 INFO L93 Difference]: Finished difference Result 1522 states and 2728 transitions. [2024-10-10 23:46:08,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:08,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-10-10 23:46:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:08,809 INFO L225 Difference]: With dead ends: 1522 [2024-10-10 23:46:08,809 INFO L226 Difference]: Without dead ends: 997 [2024-10-10 23:46:08,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:08,811 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 473 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:08,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 239 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:46:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2024-10-10 23:46:08,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 981. [2024-10-10 23:46:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.7081632653061225) internal successors, (1674), 980 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1674 transitions. [2024-10-10 23:46:08,853 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1674 transitions. Word has length 37 [2024-10-10 23:46:08,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:08,853 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1674 transitions. [2024-10-10 23:46:08,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1674 transitions. [2024-10-10 23:46:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-10 23:46:08,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:08,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:08,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:46:08,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:08,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:08,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2090111297, now seen corresponding path program 1 times [2024-10-10 23:46:08,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:08,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161907296] [2024-10-10 23:46:08,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:08,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:09,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:09,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161907296] [2024-10-10 23:46:09,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161907296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:09,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:09,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:09,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320230679] [2024-10-10 23:46:09,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:09,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:09,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:09,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:09,099 INFO L87 Difference]: Start difference. First operand 981 states and 1674 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:11,281 INFO L93 Difference]: Finished difference Result 2840 states and 4880 transitions. [2024-10-10 23:46:11,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:11,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-10-10 23:46:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:11,289 INFO L225 Difference]: With dead ends: 2840 [2024-10-10 23:46:11,289 INFO L226 Difference]: Without dead ends: 1860 [2024-10-10 23:46:11,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:11,292 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:11,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 494 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:46:11,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-10-10 23:46:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1856. [2024-10-10 23:46:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1855 states have (on average 1.4549865229110512) internal successors, (2699), 1855 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2699 transitions. [2024-10-10 23:46:11,336 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2699 transitions. Word has length 102 [2024-10-10 23:46:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:11,336 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 2699 transitions. [2024-10-10 23:46:11,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2699 transitions. [2024-10-10 23:46:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-10 23:46:11,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:11,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:11,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:46:11,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:11,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:11,350 INFO L85 PathProgramCache]: Analyzing trace with hash -10450956, now seen corresponding path program 1 times [2024-10-10 23:46:11,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:11,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330261723] [2024-10-10 23:46:11,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:11,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:11,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:11,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330261723] [2024-10-10 23:46:11,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330261723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:11,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:11,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:11,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837792183] [2024-10-10 23:46:11,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:11,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:11,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:11,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:11,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:11,774 INFO L87 Difference]: Start difference. First operand 1856 states and 2699 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:14,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:14,230 INFO L93 Difference]: Finished difference Result 4590 states and 6639 transitions. [2024-10-10 23:46:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:14,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2024-10-10 23:46:14,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:14,241 INFO L225 Difference]: With dead ends: 4590 [2024-10-10 23:46:14,242 INFO L226 Difference]: Without dead ends: 2735 [2024-10-10 23:46:14,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:14,245 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 352 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:14,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 535 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:46:14,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2024-10-10 23:46:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2715. [2024-10-10 23:46:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2714 states have (on average 1.3909358879882092) internal successors, (3775), 2714 states have internal predecessors, (3775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3775 transitions. [2024-10-10 23:46:14,293 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3775 transitions. Word has length 142 [2024-10-10 23:46:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:14,294 INFO L471 AbstractCegarLoop]: Abstraction has 2715 states and 3775 transitions. [2024-10-10 23:46:14,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3775 transitions. [2024-10-10 23:46:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-10 23:46:14,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:14,301 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:14,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:46:14,302 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:14,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:14,303 INFO L85 PathProgramCache]: Analyzing trace with hash 487329285, now seen corresponding path program 1 times [2024-10-10 23:46:14,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:14,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447392571] [2024-10-10 23:46:14,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:14,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:14,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:14,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447392571] [2024-10-10 23:46:14,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447392571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:14,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:14,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:14,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535686430] [2024-10-10 23:46:14,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:14,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:14,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:14,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:14,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:14,570 INFO L87 Difference]: Start difference. First operand 2715 states and 3775 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:16,423 INFO L93 Difference]: Finished difference Result 6708 states and 9428 transitions. [2024-10-10 23:46:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:16,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-10-10 23:46:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:16,437 INFO L225 Difference]: With dead ends: 6708 [2024-10-10 23:46:16,438 INFO L226 Difference]: Without dead ends: 3994 [2024-10-10 23:46:16,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:16,442 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:16,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:46:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2024-10-10 23:46:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3141. [2024-10-10 23:46:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3140 states have (on average 1.2745222929936306) internal successors, (4002), 3140 states have internal predecessors, (4002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4002 transitions. [2024-10-10 23:46:16,497 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4002 transitions. Word has length 148 [2024-10-10 23:46:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:16,498 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 4002 transitions. [2024-10-10 23:46:16,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4002 transitions. [2024-10-10 23:46:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-10 23:46:16,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:16,500 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:46:16,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:46:16,501 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:16,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash -456628353, now seen corresponding path program 1 times [2024-10-10 23:46:16,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:16,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721999139] [2024-10-10 23:46:16,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:16,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:16,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:16,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721999139] [2024-10-10 23:46:16,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721999139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:16,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:16,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 23:46:16,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277196811] [2024-10-10 23:46:16,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:16,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:46:16,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:16,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:46:16,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:46:16,914 INFO L87 Difference]: Start difference. First operand 3141 states and 4002 transitions. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:19,340 INFO L93 Difference]: Finished difference Result 8004 states and 10507 transitions. [2024-10-10 23:46:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:46:19,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 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 185 [2024-10-10 23:46:19,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:19,357 INFO L225 Difference]: With dead ends: 8004 [2024-10-10 23:46:19,357 INFO L226 Difference]: Without dead ends: 4864 [2024-10-10 23:46:19,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:46:19,363 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 593 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 3094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:19,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 924 Invalid, 3094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:46:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2024-10-10 23:46:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 4851. [2024-10-10 23:46:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4851 states, 4850 states have (on average 1.26659793814433) internal successors, (6143), 4850 states have internal predecessors, (6143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 6143 transitions. [2024-10-10 23:46:19,452 INFO L78 Accepts]: Start accepts. Automaton has 4851 states and 6143 transitions. Word has length 185 [2024-10-10 23:46:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:19,454 INFO L471 AbstractCegarLoop]: Abstraction has 4851 states and 6143 transitions. [2024-10-10 23:46:19,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 4851 states and 6143 transitions. [2024-10-10 23:46:19,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-10 23:46:19,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:19,458 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:46:19,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:46:19,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:19,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash -290281424, now seen corresponding path program 1 times [2024-10-10 23:46:19,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:19,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864680773] [2024-10-10 23:46:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:46:19,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:19,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864680773] [2024-10-10 23:46:19,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864680773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:19,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:19,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:19,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662877666] [2024-10-10 23:46:19,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:19,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:19,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:19,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:19,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:19,660 INFO L87 Difference]: Start difference. First operand 4851 states and 6143 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:21,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:21,543 INFO L93 Difference]: Finished difference Result 12248 states and 15824 transitions. [2024-10-10 23:46:21,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:21,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2024-10-10 23:46:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:21,564 INFO L225 Difference]: With dead ends: 12248 [2024-10-10 23:46:21,564 INFO L226 Difference]: Without dead ends: 7398 [2024-10-10 23:46:21,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:21,574 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 409 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:21,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 543 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:46:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7398 states. [2024-10-10 23:46:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7398 to 4825. [2024-10-10 23:46:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4825 states, 4824 states have (on average 1.265339966832504) internal successors, (6104), 4824 states have internal predecessors, (6104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 6104 transitions. [2024-10-10 23:46:21,677 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 6104 transitions. Word has length 191 [2024-10-10 23:46:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:21,678 INFO L471 AbstractCegarLoop]: Abstraction has 4825 states and 6104 transitions. [2024-10-10 23:46:21,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 6104 transitions. [2024-10-10 23:46:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-10 23:46:21,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:21,681 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:46:21,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:46:21,681 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:21,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:21,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1212911604, now seen corresponding path program 1 times [2024-10-10 23:46:21,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:21,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766506172] [2024-10-10 23:46:21,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:21,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:46:21,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:21,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766506172] [2024-10-10 23:46:21,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766506172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:21,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:21,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242528515] [2024-10-10 23:46:21,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:21,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:21,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:21,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:21,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:21,907 INFO L87 Difference]: Start difference. First operand 4825 states and 6104 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:23,667 INFO L93 Difference]: Finished difference Result 13480 states and 17130 transitions. [2024-10-10 23:46:23,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:23,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2024-10-10 23:46:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:23,694 INFO L225 Difference]: With dead ends: 13480 [2024-10-10 23:46:23,695 INFO L226 Difference]: Without dead ends: 8656 [2024-10-10 23:46:23,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:23,708 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 445 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:23,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 481 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:46:23,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2024-10-10 23:46:23,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 7377. [2024-10-10 23:46:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7377 states, 7376 states have (on average 1.247966377440347) internal successors, (9205), 7376 states have internal predecessors, (9205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7377 states to 7377 states and 9205 transitions. [2024-10-10 23:46:23,857 INFO L78 Accepts]: Start accepts. Automaton has 7377 states and 9205 transitions. Word has length 204 [2024-10-10 23:46:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:23,858 INFO L471 AbstractCegarLoop]: Abstraction has 7377 states and 9205 transitions. [2024-10-10 23:46:23,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 7377 states and 9205 transitions. [2024-10-10 23:46:23,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-10 23:46:23,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:23,862 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:46:23,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:46:23,862 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:23,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1211809152, now seen corresponding path program 1 times [2024-10-10 23:46:23,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:23,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102061097] [2024-10-10 23:46:23,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:23,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:24,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:24,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102061097] [2024-10-10 23:46:24,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102061097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:24,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:24,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:24,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344239706] [2024-10-10 23:46:24,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:24,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:24,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:24,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:24,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:24,215 INFO L87 Difference]: Start difference. First operand 7377 states and 9205 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:26,091 INFO L93 Difference]: Finished difference Result 19034 states and 23867 transitions. [2024-10-10 23:46:26,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:26,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2024-10-10 23:46:26,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:26,111 INFO L225 Difference]: With dead ends: 19034 [2024-10-10 23:46:26,111 INFO L226 Difference]: Without dead ends: 10806 [2024-10-10 23:46:26,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:26,121 INFO L432 NwaCegarLoop]: 819 mSDtfsCounter, 370 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:26,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 893 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:46:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10806 states. [2024-10-10 23:46:26,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10806 to 10798. [2024-10-10 23:46:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10798 states, 10797 states have (on average 1.1794016856534222) internal successors, (12734), 10797 states have internal predecessors, (12734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10798 states to 10798 states and 12734 transitions. [2024-10-10 23:46:26,254 INFO L78 Accepts]: Start accepts. Automaton has 10798 states and 12734 transitions. Word has length 253 [2024-10-10 23:46:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:26,255 INFO L471 AbstractCegarLoop]: Abstraction has 10798 states and 12734 transitions. [2024-10-10 23:46:26,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 10798 states and 12734 transitions. [2024-10-10 23:46:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-10 23:46:26,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:26,260 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:26,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:46:26,260 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:26,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:26,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1999916796, now seen corresponding path program 1 times [2024-10-10 23:46:26,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:26,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345476850] [2024-10-10 23:46:26,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:26,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 210 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-10 23:46:26,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345476850] [2024-10-10 23:46:26,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345476850] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:46:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225146459] [2024-10-10 23:46:26,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:26,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:46:26,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:46:26,653 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:46:26,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:46:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:26,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:46:26,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:46:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 210 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-10 23:46:27,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:46:27,346 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-10 23:46:27,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225146459] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:46:27,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:46:27,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-10 23:46:27,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643614624] [2024-10-10 23:46:27,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:27,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:46:27,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:27,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:46:27,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:46:27,349 INFO L87 Difference]: Start difference. First operand 10798 states and 12734 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:30,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:30,385 INFO L93 Difference]: Finished difference Result 35676 states and 42171 transitions. [2024-10-10 23:46:30,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:46:30,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 261 [2024-10-10 23:46:30,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:30,420 INFO L225 Difference]: With dead ends: 35676 [2024-10-10 23:46:30,420 INFO L226 Difference]: Without dead ends: 24018 [2024-10-10 23:46:30,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:46:30,434 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 1085 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 1254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 3523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1254 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:30,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 141 Invalid, 3523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1254 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:46:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24018 states. [2024-10-10 23:46:30,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24018 to 22741. [2024-10-10 23:46:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22741 states, 22740 states have (on average 1.155321020228672) internal successors, (26272), 22740 states have internal predecessors, (26272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22741 states to 22741 states and 26272 transitions. [2024-10-10 23:46:30,705 INFO L78 Accepts]: Start accepts. Automaton has 22741 states and 26272 transitions. Word has length 261 [2024-10-10 23:46:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:30,705 INFO L471 AbstractCegarLoop]: Abstraction has 22741 states and 26272 transitions. [2024-10-10 23:46:30,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 22741 states and 26272 transitions. [2024-10-10 23:46:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-10 23:46:30,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:30,710 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:30,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:46:30,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 23:46:30,911 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:30,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:30,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2127945056, now seen corresponding path program 1 times [2024-10-10 23:46:30,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:30,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143168911] [2024-10-10 23:46:30,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:46:31,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143168911] [2024-10-10 23:46:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143168911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:31,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:31,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:31,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071672674] [2024-10-10 23:46:31,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:31,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:31,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:31,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:31,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:31,093 INFO L87 Difference]: Start difference. First operand 22741 states and 26272 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:32,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:32,758 INFO L93 Difference]: Finished difference Result 50582 states and 58591 transitions. [2024-10-10 23:46:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:32,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2024-10-10 23:46:32,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:32,805 INFO L225 Difference]: With dead ends: 50582 [2024-10-10 23:46:32,806 INFO L226 Difference]: Without dead ends: 27415 [2024-10-10 23:46:32,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:32,831 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 378 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:32,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 839 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:46:32,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27415 states. [2024-10-10 23:46:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27415 to 27415. [2024-10-10 23:46:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27415 states, 27414 states have (on average 1.1312103304880718) internal successors, (31011), 27414 states have internal predecessors, (31011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27415 states to 27415 states and 31011 transitions. [2024-10-10 23:46:33,147 INFO L78 Accepts]: Start accepts. Automaton has 27415 states and 31011 transitions. Word has length 274 [2024-10-10 23:46:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:33,147 INFO L471 AbstractCegarLoop]: Abstraction has 27415 states and 31011 transitions. [2024-10-10 23:46:33,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 27415 states and 31011 transitions. [2024-10-10 23:46:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-10-10 23:46:33,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:33,155 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:33,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:46:33,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:33,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash 774884790, now seen corresponding path program 1 times [2024-10-10 23:46:33,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:33,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116834758] [2024-10-10 23:46:33,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:33,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 232 proven. 78 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-10 23:46:33,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116834758] [2024-10-10 23:46:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116834758] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:46:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657855460] [2024-10-10 23:46:33,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:33,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:46:33,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:46:33,667 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:46:33,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:46:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:33,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:46:33,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:46:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 232 proven. 78 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-10 23:46:34,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:46:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-10 23:46:34,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657855460] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:46:34,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:46:34,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-10 23:46:34,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884573393] [2024-10-10 23:46:34,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:34,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:46:34,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:34,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:46:34,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:46:34,293 INFO L87 Difference]: Start difference. First operand 27415 states and 31011 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:36,907 INFO L93 Difference]: Finished difference Result 68480 states and 77436 transitions. [2024-10-10 23:46:36,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:46:36,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 332 [2024-10-10 23:46:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:36,960 INFO L225 Difference]: With dead ends: 68480 [2024-10-10 23:46:36,961 INFO L226 Difference]: Without dead ends: 40639 [2024-10-10 23:46:36,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:46:36,984 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 874 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 2879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:36,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 177 Invalid, 2879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:46:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40639 states. [2024-10-10 23:46:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40639 to 38511. [2024-10-10 23:46:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38511 states, 38510 states have (on average 1.133861334718255) internal successors, (43665), 38510 states have internal predecessors, (43665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38511 states to 38511 states and 43665 transitions. [2024-10-10 23:46:37,407 INFO L78 Accepts]: Start accepts. Automaton has 38511 states and 43665 transitions. Word has length 332 [2024-10-10 23:46:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:37,408 INFO L471 AbstractCegarLoop]: Abstraction has 38511 states and 43665 transitions. [2024-10-10 23:46:37,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 38511 states and 43665 transitions. [2024-10-10 23:46:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-10-10 23:46:37,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:37,418 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:37,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:46:37,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:46:37,623 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:37,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1069669604, now seen corresponding path program 1 times [2024-10-10 23:46:37,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:37,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317987394] [2024-10-10 23:46:37,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:37,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-10 23:46:37,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:37,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317987394] [2024-10-10 23:46:37,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317987394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:37,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:37,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:37,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783900168] [2024-10-10 23:46:37,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:37,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:37,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:37,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:37,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:37,976 INFO L87 Difference]: Start difference. First operand 38511 states and 43665 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:39,506 INFO L93 Difference]: Finished difference Result 89784 states and 102266 transitions. [2024-10-10 23:46:39,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:39,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 432 [2024-10-10 23:46:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:39,570 INFO L225 Difference]: With dead ends: 89784 [2024-10-10 23:46:39,570 INFO L226 Difference]: Without dead ends: 49572 [2024-10-10 23:46:39,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:39,607 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 338 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:39,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 784 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:46:39,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49572 states. [2024-10-10 23:46:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49572 to 37618. [2024-10-10 23:46:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37618 states, 37617 states have (on average 1.1327325411383151) internal successors, (42610), 37617 states have internal predecessors, (42610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37618 states to 37618 states and 42610 transitions. [2024-10-10 23:46:40,254 INFO L78 Accepts]: Start accepts. Automaton has 37618 states and 42610 transitions. Word has length 432 [2024-10-10 23:46:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:40,255 INFO L471 AbstractCegarLoop]: Abstraction has 37618 states and 42610 transitions. [2024-10-10 23:46:40,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 37618 states and 42610 transitions. [2024-10-10 23:46:40,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2024-10-10 23:46:40,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:40,276 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:46:40,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:46:40,276 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:40,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:40,277 INFO L85 PathProgramCache]: Analyzing trace with hash 482394593, now seen corresponding path program 1 times [2024-10-10 23:46:40,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:40,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530341283] [2024-10-10 23:46:40,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:40,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2024-10-10 23:46:40,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:40,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530341283] [2024-10-10 23:46:40,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530341283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:40,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:40,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:40,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603819116] [2024-10-10 23:46:40,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:40,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:40,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:40,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:40,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:40,719 INFO L87 Difference]: Start difference. First operand 37618 states and 42610 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:42,500 INFO L93 Difference]: Finished difference Result 87613 states and 98820 transitions. [2024-10-10 23:46:42,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:42,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 433 [2024-10-10 23:46:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:42,552 INFO L225 Difference]: With dead ends: 87613 [2024-10-10 23:46:42,553 INFO L226 Difference]: Without dead ends: 49570 [2024-10-10 23:46:42,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:42,576 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 453 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:42,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 346 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:46:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49570 states. [2024-10-10 23:46:42,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49570 to 38041. [2024-10-10 23:46:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38041 states, 38040 states have (on average 1.1311251314405888) internal successors, (43028), 38040 states have internal predecessors, (43028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38041 states to 38041 states and 43028 transitions. [2024-10-10 23:46:42,961 INFO L78 Accepts]: Start accepts. Automaton has 38041 states and 43028 transitions. Word has length 433 [2024-10-10 23:46:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:42,962 INFO L471 AbstractCegarLoop]: Abstraction has 38041 states and 43028 transitions. [2024-10-10 23:46:42,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 38041 states and 43028 transitions. [2024-10-10 23:46:42,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-10-10 23:46:42,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:42,973 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:42,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:46:42,974 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:42,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:42,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1814589054, now seen corresponding path program 1 times [2024-10-10 23:46:42,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:42,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318187428] [2024-10-10 23:46:42,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:42,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-10-10 23:46:43,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:43,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318187428] [2024-10-10 23:46:43,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318187428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:43,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:43,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:43,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659791317] [2024-10-10 23:46:43,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:43,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:43,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:43,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:43,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:43,341 INFO L87 Difference]: Start difference. First operand 38041 states and 43028 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:44,941 INFO L93 Difference]: Finished difference Result 90133 states and 101692 transitions. [2024-10-10 23:46:44,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:44,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 460 [2024-10-10 23:46:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:44,996 INFO L225 Difference]: With dead ends: 90133 [2024-10-10 23:46:44,997 INFO L226 Difference]: Without dead ends: 51667 [2024-10-10 23:46:45,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:45,026 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 488 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:45,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 297 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:46:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51667 states. [2024-10-10 23:46:45,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51667 to 38440. [2024-10-10 23:46:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38440 states, 38439 states have (on average 1.120554645021983) internal successors, (43073), 38439 states have internal predecessors, (43073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:45,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38440 states to 38440 states and 43073 transitions. [2024-10-10 23:46:45,558 INFO L78 Accepts]: Start accepts. Automaton has 38440 states and 43073 transitions. Word has length 460 [2024-10-10 23:46:45,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:45,559 INFO L471 AbstractCegarLoop]: Abstraction has 38440 states and 43073 transitions. [2024-10-10 23:46:45,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:45,559 INFO L276 IsEmpty]: Start isEmpty. Operand 38440 states and 43073 transitions. [2024-10-10 23:46:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-10-10 23:46:45,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:45,571 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:45,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:46:45,571 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:45,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:45,572 INFO L85 PathProgramCache]: Analyzing trace with hash 615180713, now seen corresponding path program 1 times [2024-10-10 23:46:45,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:45,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788493074] [2024-10-10 23:46:45,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:45,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:46:46,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:46,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788493074] [2024-10-10 23:46:46,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788493074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:46,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:46,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:46:46,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209326670] [2024-10-10 23:46:46,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:46,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:46:46,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:46,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:46:46,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:46:46,646 INFO L87 Difference]: Start difference. First operand 38440 states and 43073 transitions. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:49,146 INFO L93 Difference]: Finished difference Result 88378 states and 98834 transitions. [2024-10-10 23:46:49,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:46:49,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 472 [2024-10-10 23:46:49,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:49,197 INFO L225 Difference]: With dead ends: 88378 [2024-10-10 23:46:49,197 INFO L226 Difference]: Without dead ends: 49514 [2024-10-10 23:46:49,208 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-10-10 23:46:49,209 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 877 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1853 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:49,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 303 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1853 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:46:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49514 states. [2024-10-10 23:46:49,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49514 to 46099. [2024-10-10 23:46:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46099 states, 46098 states have (on average 1.1141698121393553) internal successors, (51361), 46098 states have internal predecessors, (51361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46099 states to 46099 states and 51361 transitions. [2024-10-10 23:46:49,609 INFO L78 Accepts]: Start accepts. Automaton has 46099 states and 51361 transitions. Word has length 472 [2024-10-10 23:46:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:49,610 INFO L471 AbstractCegarLoop]: Abstraction has 46099 states and 51361 transitions. [2024-10-10 23:46:49,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 46099 states and 51361 transitions. [2024-10-10 23:46:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2024-10-10 23:46:49,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:49,625 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:49,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:46:49,625 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:49,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:49,626 INFO L85 PathProgramCache]: Analyzing trace with hash -119892235, now seen corresponding path program 1 times [2024-10-10 23:46:49,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:49,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369215528] [2024-10-10 23:46:49,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:49,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:46:49,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:49,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369215528] [2024-10-10 23:46:49,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369215528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:49,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:49,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:49,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320878018] [2024-10-10 23:46:49,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:49,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:49,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:49,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:49,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:49,904 INFO L87 Difference]: Start difference. First operand 46099 states and 51361 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:51,595 INFO L93 Difference]: Finished difference Result 99429 states and 110844 transitions. [2024-10-10 23:46:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:51,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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 480 [2024-10-10 23:46:51,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:51,650 INFO L225 Difference]: With dead ends: 99429 [2024-10-10 23:46:51,651 INFO L226 Difference]: Without dead ends: 52905 [2024-10-10 23:46:51,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:51,682 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 474 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:51,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 254 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:46:51,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52905 states. [2024-10-10 23:46:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52905 to 49921. [2024-10-10 23:46:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49921 states, 49920 states have (on average 1.112540064102564) internal successors, (55538), 49920 states have internal predecessors, (55538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49921 states to 49921 states and 55538 transitions. [2024-10-10 23:46:52,395 INFO L78 Accepts]: Start accepts. Automaton has 49921 states and 55538 transitions. Word has length 480 [2024-10-10 23:46:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:52,396 INFO L471 AbstractCegarLoop]: Abstraction has 49921 states and 55538 transitions. [2024-10-10 23:46:52,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 49921 states and 55538 transitions. [2024-10-10 23:46:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2024-10-10 23:46:52,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:52,406 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:46:52,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:46:52,406 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:52,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:52,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1095902566, now seen corresponding path program 1 times [2024-10-10 23:46:52,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:52,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944800970] [2024-10-10 23:46:52,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-10 23:46:53,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:53,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944800970] [2024-10-10 23:46:53,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944800970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:53,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:53,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:46:53,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189833267] [2024-10-10 23:46:53,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:53,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:46:53,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:53,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:46:53,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:46:53,571 INFO L87 Difference]: Start difference. First operand 49921 states and 55538 transitions. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:56,255 INFO L93 Difference]: Finished difference Result 127551 states and 141062 transitions. [2024-10-10 23:46:56,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:46:56,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 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 481 [2024-10-10 23:46:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:56,339 INFO L225 Difference]: With dead ends: 127551 [2024-10-10 23:46:56,339 INFO L226 Difference]: Without dead ends: 73797 [2024-10-10 23:46:56,382 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-10-10 23:46:56,382 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 746 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 2686 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 2686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:56,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 276 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 2686 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:46:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73797 states. [2024-10-10 23:46:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73797 to 68226. [2024-10-10 23:46:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68226 states, 68225 states have (on average 1.1045511176255038) internal successors, (75358), 68225 states have internal predecessors, (75358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68226 states to 68226 states and 75358 transitions. [2024-10-10 23:46:57,228 INFO L78 Accepts]: Start accepts. Automaton has 68226 states and 75358 transitions. Word has length 481 [2024-10-10 23:46:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:57,229 INFO L471 AbstractCegarLoop]: Abstraction has 68226 states and 75358 transitions. [2024-10-10 23:46:57,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 68226 states and 75358 transitions. [2024-10-10 23:46:57,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2024-10-10 23:46:57,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:57,238 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:57,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:46:57,239 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:57,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:57,239 INFO L85 PathProgramCache]: Analyzing trace with hash -343265053, now seen corresponding path program 1 times [2024-10-10 23:46:57,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:57,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175316282] [2024-10-10 23:46:57,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:57,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:46:58,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:58,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175316282] [2024-10-10 23:46:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175316282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:58,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:58,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:46:58,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311159749] [2024-10-10 23:46:58,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:58,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:46:58,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:58,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:46:58,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:46:58,466 INFO L87 Difference]: Start difference. First operand 68226 states and 75358 transitions. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:00,787 INFO L93 Difference]: Finished difference Result 144968 states and 159656 transitions. [2024-10-10 23:47:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:47:00,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 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 485 [2024-10-10 23:47:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:00,873 INFO L225 Difference]: With dead ends: 144968 [2024-10-10 23:47:00,873 INFO L226 Difference]: Without dead ends: 76318 [2024-10-10 23:47:00,922 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-10-10 23:47:00,923 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 645 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2432 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 2641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:00,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 345 Invalid, 2641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2432 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:47:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76318 states. [2024-10-10 23:47:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76318 to 70351. [2024-10-10 23:47:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70351 states, 70350 states have (on average 1.1027007818052594) internal successors, (77575), 70350 states have internal predecessors, (77575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70351 states to 70351 states and 77575 transitions. [2024-10-10 23:47:01,769 INFO L78 Accepts]: Start accepts. Automaton has 70351 states and 77575 transitions. Word has length 485 [2024-10-10 23:47:01,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:01,770 INFO L471 AbstractCegarLoop]: Abstraction has 70351 states and 77575 transitions. [2024-10-10 23:47:01,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:01,770 INFO L276 IsEmpty]: Start isEmpty. Operand 70351 states and 77575 transitions. [2024-10-10 23:47:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2024-10-10 23:47:01,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:01,984 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:01,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:47:01,985 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:01,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:01,987 INFO L85 PathProgramCache]: Analyzing trace with hash -75131185, now seen corresponding path program 1 times [2024-10-10 23:47:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:01,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696460608] [2024-10-10 23:47:01,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:01,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:47:02,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:02,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696460608] [2024-10-10 23:47:02,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696460608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:02,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:02,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:47:02,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061217034] [2024-10-10 23:47:02,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:02,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:47:02,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:02,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:47:02,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:47:02,745 INFO L87 Difference]: Start difference. First operand 70351 states and 77575 transitions. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:05,303 INFO L93 Difference]: Finished difference Result 165421 states and 181961 transitions. [2024-10-10 23:47:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:47:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 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 493 [2024-10-10 23:47:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:05,408 INFO L225 Difference]: With dead ends: 165421 [2024-10-10 23:47:05,409 INFO L226 Difference]: Without dead ends: 95071 [2024-10-10 23:47:05,444 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-10-10 23:47:05,445 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 645 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:05,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 164 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:47:05,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95071 states. [2024-10-10 23:47:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95071 to 91233. [2024-10-10 23:47:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91233 states, 91232 states have (on average 1.097334268677657) internal successors, (100112), 91232 states have internal predecessors, (100112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91233 states to 91233 states and 100112 transitions. [2024-10-10 23:47:06,561 INFO L78 Accepts]: Start accepts. Automaton has 91233 states and 100112 transitions. Word has length 493 [2024-10-10 23:47:06,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:06,562 INFO L471 AbstractCegarLoop]: Abstraction has 91233 states and 100112 transitions. [2024-10-10 23:47:06,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:06,562 INFO L276 IsEmpty]: Start isEmpty. Operand 91233 states and 100112 transitions. [2024-10-10 23:47:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2024-10-10 23:47:06,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:06,573 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:06,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:47:06,573 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:06,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:06,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1173360167, now seen corresponding path program 1 times [2024-10-10 23:47:06,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:06,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565027680] [2024-10-10 23:47:06,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:06,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:47:07,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:07,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565027680] [2024-10-10 23:47:07,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565027680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:07,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:07,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:47:07,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42940573] [2024-10-10 23:47:07,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:07,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:47:07,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:07,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:47:07,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:47:07,854 INFO L87 Difference]: Start difference. First operand 91233 states and 100112 transitions. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:10,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:10,169 INFO L93 Difference]: Finished difference Result 200355 states and 219558 transitions. [2024-10-10 23:47:10,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:47:10,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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 528 [2024-10-10 23:47:10,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:10,303 INFO L225 Difference]: With dead ends: 200355 [2024-10-10 23:47:10,303 INFO L226 Difference]: Without dead ends: 108698 [2024-10-10 23:47:10,358 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-10-10 23:47:10,358 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 871 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:10,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 262 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:47:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108698 states. [2024-10-10 23:47:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108698 to 95069. [2024-10-10 23:47:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95069 states, 95068 states have (on average 1.0965519417679976) internal successors, (104247), 95068 states have internal predecessors, (104247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95069 states to 95069 states and 104247 transitions. [2024-10-10 23:47:11,736 INFO L78 Accepts]: Start accepts. Automaton has 95069 states and 104247 transitions. Word has length 528 [2024-10-10 23:47:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:11,737 INFO L471 AbstractCegarLoop]: Abstraction has 95069 states and 104247 transitions. [2024-10-10 23:47:11,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 95069 states and 104247 transitions. [2024-10-10 23:47:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2024-10-10 23:47:11,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:11,748 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:11,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:47:11,748 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:11,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1108214213, now seen corresponding path program 1 times [2024-10-10 23:47:11,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:11,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20316080] [2024-10-10 23:47:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-10 23:47:12,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:12,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20316080] [2024-10-10 23:47:12,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20316080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:12,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:12,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:12,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008971163] [2024-10-10 23:47:12,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:12,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:12,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:12,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:12,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:12,445 INFO L87 Difference]: Start difference. First operand 95069 states and 104247 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)