./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label09.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b320c505e975e60a8773fab452d31c385380f52ca8479f4ba88c3e2472a94a3a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:52:09,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:52:09,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:52:09,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:52:09,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:52:10,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:52:10,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:52:10,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:52:10,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:52:10,013 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:52:10,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:52:10,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:52:10,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:52:10,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:52:10,015 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:52:10,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:52:10,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:52:10,017 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:52:10,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:52:10,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:52:10,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:52:10,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:52:10,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:52:10,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:52:10,019 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:52:10,019 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:52:10,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:52:10,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:52:10,020 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:52:10,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:52:10,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:52:10,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:52:10,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:52:10,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:52:10,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:52:10,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:52:10,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:52:10,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:52:10,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:52:10,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:52:10,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:52:10,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:52:10,024 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b320c505e975e60a8773fab452d31c385380f52ca8479f4ba88c3e2472a94a3a [2024-11-10 00:52:10,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:52:10,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:52:10,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:52:10,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:52:10,294 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:52:10,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 00:52:11,682 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:52:12,215 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:52:12,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 00:52:12,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87795b823/cf394e50608c4ecf8d5793a04e30228e/FLAG6f6e4f30d [2024-11-10 00:52:12,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87795b823/cf394e50608c4ecf8d5793a04e30228e [2024-11-10 00:52:12,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:52:12,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:52:12,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:52:12,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:52:12,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:52:12,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:52:12" (1/1) ... [2024-11-10 00:52:12,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2729112d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:12, skipping insertion in model container [2024-11-10 00:52:12,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:52:12" (1/1) ... [2024-11-10 00:52:12,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:52:13,302 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label09.c[8712,8725] [2024-11-10 00:52:13,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label09.c[16460,16473] [2024-11-10 00:52:14,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:52:14,106 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:52:14,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label09.c[8712,8725] [2024-11-10 00:52:14,157 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label09.c[16460,16473] [2024-11-10 00:52:14,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:52:14,585 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:52:14,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:14 WrapperNode [2024-11-10 00:52:14,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:52:14,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:52:14,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:52:14,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:52:14,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:14" (1/1) ... [2024-11-10 00:52:14,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:14" (1/1) ... [2024-11-10 00:52:15,076 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5037 [2024-11-10 00:52:15,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:52:15,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:52:15,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:52:15,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:52:15,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:14" (1/1) ... [2024-11-10 00:52:15,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:14" (1/1) ... [2024-11-10 00:52:15,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:14" (1/1) ... [2024-11-10 00:52:15,289 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:52:15,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:14" (1/1) ... [2024-11-10 00:52:15,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:14" (1/1) ... [2024-11-10 00:52:15,507 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:14" (1/1) ... [2024-11-10 00:52:15,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:14" (1/1) ... [2024-11-10 00:52:15,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:14" (1/1) ... [2024-11-10 00:52:15,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:14" (1/1) ... [2024-11-10 00:52:15,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:52:15,669 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:52:15,669 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:52:15,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:52:15,671 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:14" (1/1) ... [2024-11-10 00:52:15,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:52:15,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:15,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:52:15,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:52:15,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:52:15,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:52:15,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:52:15,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:52:15,862 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:52:15,865 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:52:21,631 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5025: havoc calculate_output3_#t~ret35#1; [2024-11-10 00:52:21,632 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc calculate_output_#t~ret33#1; [2024-11-10 00:52:21,633 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3535: havoc calculate_output2_#t~ret34#1; [2024-11-10 00:52:21,888 INFO L? ?]: Removed 2076 outVars from TransFormulas that were not future-live. [2024-11-10 00:52:21,888 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:52:21,929 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:52:21,930 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:52:21,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:52:21 BoogieIcfgContainer [2024-11-10 00:52:21,930 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:52:21,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:52:21,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:52:21,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:52:21,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:52:12" (1/3) ... [2024-11-10 00:52:21,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46fda945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:52:21, skipping insertion in model container [2024-11-10 00:52:21,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:14" (2/3) ... [2024-11-10 00:52:21,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46fda945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:52:21, skipping insertion in model container [2024-11-10 00:52:21,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:52:21" (3/3) ... [2024-11-10 00:52:21,942 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 00:52:21,959 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:52:21,960 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:52:22,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:52:22,086 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;@c00f31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:52:22,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:52:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 894 states, 891 states have (on average 2.6610549943883277) internal successors, (2371), 893 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 00:52:22,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:22,109 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] [2024-11-10 00:52:22,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:22,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:22,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1060858498, now seen corresponding path program 1 times [2024-11-10 00:52:22,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:22,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986233100] [2024-11-10 00:52:22,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:22,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:22,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:22,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:22,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986233100] [2024-11-10 00:52:22,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986233100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:22,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:22,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:52:22,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732640081] [2024-11-10 00:52:22,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:22,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:52:22,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:22,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:52:22,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:52:22,467 INFO L87 Difference]: Start difference. First operand has 894 states, 891 states have (on average 2.6610549943883277) internal successors, (2371), 893 states have internal predecessors, (2371), 0 states have call successors, (0), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:22,611 INFO L93 Difference]: Finished difference Result 1755 states and 4684 transitions. [2024-11-10 00:52:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:52:22,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-10 00:52:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:22,638 INFO L225 Difference]: With dead ends: 1755 [2024-11-10 00:52:22,639 INFO L226 Difference]: Without dead ends: 826 [2024-11-10 00:52:22,644 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-11-10 00:52:22,647 INFO L432 NwaCegarLoop]: 2300 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:22,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-10 00:52:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2024-11-10 00:52:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 824 states have (on average 2.7135922330097086) internal successors, (2236), 825 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2236 transitions. [2024-11-10 00:52:22,742 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2236 transitions. Word has length 24 [2024-11-10 00:52:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:22,742 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 2236 transitions. [2024-11-10 00:52:22,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2236 transitions. [2024-11-10 00:52:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 00:52:22,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:22,744 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] [2024-11-10 00:52:22,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:52:22,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:22,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash 63786145, now seen corresponding path program 1 times [2024-11-10 00:52:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:22,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153412233] [2024-11-10 00:52:22,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:22,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:22,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:22,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153412233] [2024-11-10 00:52:22,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153412233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:22,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:22,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:52:22,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968274830] [2024-11-10 00:52:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:22,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:52:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:22,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:52:22,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:52:22,984 INFO L87 Difference]: Start difference. First operand 826 states and 2236 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:23,121 INFO L93 Difference]: Finished difference Result 871 states and 2303 transitions. [2024-11-10 00:52:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:52:23,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-10 00:52:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:23,128 INFO L225 Difference]: With dead ends: 871 [2024-11-10 00:52:23,129 INFO L226 Difference]: Without dead ends: 826 [2024-11-10 00:52:23,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:52:23,132 INFO L432 NwaCegarLoop]: 2234 mSDtfsCounter, 0 mSDsluCounter, 6674 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8908 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:23,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8908 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:23,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-10 00:52:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2024-11-10 00:52:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 824 states have (on average 2.6856796116504853) internal successors, (2213), 825 states have internal predecessors, (2213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2213 transitions. [2024-11-10 00:52:23,174 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2213 transitions. Word has length 24 [2024-11-10 00:52:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:23,175 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 2213 transitions. [2024-11-10 00:52:23,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2213 transitions. [2024-11-10 00:52:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 00:52:23,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:23,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:23,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:52:23,179 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:23,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash -38432181, now seen corresponding path program 1 times [2024-11-10 00:52:23,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:23,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468594079] [2024-11-10 00:52:23,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:23,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:23,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:23,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468594079] [2024-11-10 00:52:23,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468594079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:23,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:23,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:23,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498712767] [2024-11-10 00:52:23,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:23,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:23,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:23,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:23,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:23,391 INFO L87 Difference]: Start difference. First operand 826 states and 2213 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:23,595 INFO L93 Difference]: Finished difference Result 1154 states and 2717 transitions. [2024-11-10 00:52:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:52:23,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-10 00:52:23,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:23,603 INFO L225 Difference]: With dead ends: 1154 [2024-11-10 00:52:23,604 INFO L226 Difference]: Without dead ends: 1113 [2024-11-10 00:52:23,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:52:23,607 INFO L432 NwaCegarLoop]: 2207 mSDtfsCounter, 9037 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9037 SdHoareTripleChecker+Valid, 2853 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:23,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9037 Valid, 2853 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-10 00:52:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 864. [2024-11-10 00:52:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 862 states have (on average 2.6357308584686776) internal successors, (2272), 863 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 2272 transitions. [2024-11-10 00:52:23,643 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 2272 transitions. Word has length 46 [2024-11-10 00:52:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:23,644 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 2272 transitions. [2024-11-10 00:52:23,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 2272 transitions. [2024-11-10 00:52:23,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 00:52:23,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:23,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:23,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:52:23,649 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:23,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:23,650 INFO L85 PathProgramCache]: Analyzing trace with hash -284227027, now seen corresponding path program 1 times [2024-11-10 00:52:23,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:23,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921303292] [2024-11-10 00:52:23,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:23,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:23,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:23,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921303292] [2024-11-10 00:52:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921303292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:23,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:23,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:23,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221557285] [2024-11-10 00:52:23,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:23,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:23,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:23,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:23,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:23,906 INFO L87 Difference]: Start difference. First operand 864 states and 2272 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:24,069 INFO L93 Difference]: Finished difference Result 946 states and 2396 transitions. [2024-11-10 00:52:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:24,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-10 00:52:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:24,076 INFO L225 Difference]: With dead ends: 946 [2024-11-10 00:52:24,076 INFO L226 Difference]: Without dead ends: 867 [2024-11-10 00:52:24,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:52:24,080 INFO L432 NwaCegarLoop]: 2207 mSDtfsCounter, 4342 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4342 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:24,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4342 Valid, 2384 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-11-10 00:52:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 864. [2024-11-10 00:52:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 862 states have (on average 2.6345707656612527) internal successors, (2271), 863 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 2271 transitions. [2024-11-10 00:52:24,109 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 2271 transitions. Word has length 48 [2024-11-10 00:52:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:24,110 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 2271 transitions. [2024-11-10 00:52:24,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 2271 transitions. [2024-11-10 00:52:24,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 00:52:24,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:24,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:24,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:52:24,115 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:24,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:24,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1502715960, now seen corresponding path program 1 times [2024-11-10 00:52:24,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:24,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597233152] [2024-11-10 00:52:24,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:24,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597233152] [2024-11-10 00:52:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597233152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:24,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:24,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:24,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377264726] [2024-11-10 00:52:24,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:24,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:24,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:24,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:24,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:24,208 INFO L87 Difference]: Start difference. First operand 864 states and 2271 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:24,256 INFO L93 Difference]: Finished difference Result 1010 states and 2493 transitions. [2024-11-10 00:52:24,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:24,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-10 00:52:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:24,263 INFO L225 Difference]: With dead ends: 1010 [2024-11-10 00:52:24,263 INFO L226 Difference]: Without dead ends: 931 [2024-11-10 00:52:24,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:24,265 INFO L432 NwaCegarLoop]: 2209 mSDtfsCounter, 2160 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:24,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 2265 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:24,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-11-10 00:52:24,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 926. [2024-11-10 00:52:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 924 states have (on average 2.5573593073593073) internal successors, (2363), 925 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 2363 transitions. [2024-11-10 00:52:24,297 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 2363 transitions. Word has length 49 [2024-11-10 00:52:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:24,299 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 2363 transitions. [2024-11-10 00:52:24,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 2363 transitions. [2024-11-10 00:52:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:24,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:24,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:24,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:52:24,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:24,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:24,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1220941777, now seen corresponding path program 1 times [2024-11-10 00:52:24,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:24,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973551428] [2024-11-10 00:52:24,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:24,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:24,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:24,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973551428] [2024-11-10 00:52:24,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973551428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:24,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:24,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90577057] [2024-11-10 00:52:24,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:24,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:24,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:24,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:24,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:24,372 INFO L87 Difference]: Start difference. First operand 926 states and 2363 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:24,413 INFO L93 Difference]: Finished difference Result 1192 states and 2761 transitions. [2024-11-10 00:52:24,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:24,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:52:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:24,420 INFO L225 Difference]: With dead ends: 1192 [2024-11-10 00:52:24,420 INFO L226 Difference]: Without dead ends: 1051 [2024-11-10 00:52:24,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:24,422 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 2171 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2171 SdHoareTripleChecker+Valid, 2320 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:24,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2171 Valid, 2320 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-11-10 00:52:24,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1048. [2024-11-10 00:52:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1046 states have (on average 2.4302103250478013) internal successors, (2542), 1047 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 2542 transitions. [2024-11-10 00:52:24,457 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 2542 transitions. Word has length 50 [2024-11-10 00:52:24,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:24,458 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 2542 transitions. [2024-11-10 00:52:24,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 2542 transitions. [2024-11-10 00:52:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:24,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:24,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:24,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:52:24,460 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:24,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:24,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1235391633, now seen corresponding path program 1 times [2024-11-10 00:52:24,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:24,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316279075] [2024-11-10 00:52:24,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:24,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:24,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316279075] [2024-11-10 00:52:24,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316279075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:24,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:24,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:24,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406735414] [2024-11-10 00:52:24,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:24,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:24,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:24,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:24,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:24,534 INFO L87 Difference]: Start difference. First operand 1048 states and 2542 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:24,629 INFO L93 Difference]: Finished difference Result 1542 states and 3270 transitions. [2024-11-10 00:52:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:24,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:52:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:24,636 INFO L225 Difference]: With dead ends: 1542 [2024-11-10 00:52:24,636 INFO L226 Difference]: Without dead ends: 1279 [2024-11-10 00:52:24,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:24,638 INFO L432 NwaCegarLoop]: 2250 mSDtfsCounter, 2169 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 2322 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:24,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 2322 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2024-11-10 00:52:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1276. [2024-11-10 00:52:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1274 states have (on average 2.2511773940345368) internal successors, (2868), 1275 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 2868 transitions. [2024-11-10 00:52:24,673 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 2868 transitions. Word has length 50 [2024-11-10 00:52:24,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:24,673 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 2868 transitions. [2024-11-10 00:52:24,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 2868 transitions. [2024-11-10 00:52:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:24,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:24,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:24,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:52:24,675 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:24,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:24,675 INFO L85 PathProgramCache]: Analyzing trace with hash 856211119, now seen corresponding path program 1 times [2024-11-10 00:52:24,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:24,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358980966] [2024-11-10 00:52:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:24,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:24,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:24,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358980966] [2024-11-10 00:52:24,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358980966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:24,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:24,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:24,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644284622] [2024-11-10 00:52:24,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:24,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:24,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:24,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:24,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:24,730 INFO L87 Difference]: Start difference. First operand 1276 states and 2868 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:24,779 INFO L93 Difference]: Finished difference Result 2194 states and 4192 transitions. [2024-11-10 00:52:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:24,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:52:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:24,789 INFO L225 Difference]: With dead ends: 2194 [2024-11-10 00:52:24,789 INFO L226 Difference]: Without dead ends: 1703 [2024-11-10 00:52:24,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:24,792 INFO L432 NwaCegarLoop]: 2248 mSDtfsCounter, 2167 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2167 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:24,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2167 Valid, 2324 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-11-10 00:52:24,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1700. [2024-11-10 00:52:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1698 states have (on average 2.035335689045936) internal successors, (3456), 1699 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 3456 transitions. [2024-11-10 00:52:24,836 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 3456 transitions. Word has length 50 [2024-11-10 00:52:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:24,837 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 3456 transitions. [2024-11-10 00:52:24,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 3456 transitions. [2024-11-10 00:52:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:24,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:24,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:52:24,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:24,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:24,839 INFO L85 PathProgramCache]: Analyzing trace with hash 331934064, now seen corresponding path program 1 times [2024-11-10 00:52:24,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:24,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585417127] [2024-11-10 00:52:24,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:24,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:25,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:25,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585417127] [2024-11-10 00:52:25,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585417127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:25,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:25,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:52:25,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682396319] [2024-11-10 00:52:25,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:25,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:52:25,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:25,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:52:25,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:52:25,051 INFO L87 Difference]: Start difference. First operand 1700 states and 3456 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:25,111 INFO L93 Difference]: Finished difference Result 1751 states and 3522 transitions. [2024-11-10 00:52:25,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:52:25,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 00:52:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:25,120 INFO L225 Difference]: With dead ends: 1751 [2024-11-10 00:52:25,121 INFO L226 Difference]: Without dead ends: 1748 [2024-11-10 00:52:25,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:52:25,123 INFO L432 NwaCegarLoop]: 2210 mSDtfsCounter, 0 mSDsluCounter, 6621 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8831 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:25,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8831 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2024-11-10 00:52:25,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1748. [2024-11-10 00:52:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1746 states have (on average 2.002290950744559) internal successors, (3496), 1747 states have internal predecessors, (3496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 3496 transitions. [2024-11-10 00:52:25,171 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 3496 transitions. Word has length 50 [2024-11-10 00:52:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:25,172 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 3496 transitions. [2024-11-10 00:52:25,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 3496 transitions. [2024-11-10 00:52:25,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 00:52:25,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:25,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:25,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:52:25,173 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:25,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:25,174 INFO L85 PathProgramCache]: Analyzing trace with hash 922171759, now seen corresponding path program 1 times [2024-11-10 00:52:25,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:25,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575390150] [2024-11-10 00:52:25,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:25,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:25,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:25,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575390150] [2024-11-10 00:52:25,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575390150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:25,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:25,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:25,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482027418] [2024-11-10 00:52:25,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:25,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:25,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:25,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:25,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:25,229 INFO L87 Difference]: Start difference. First operand 1748 states and 3496 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:25,273 INFO L93 Difference]: Finished difference Result 2782 states and 4961 transitions. [2024-11-10 00:52:25,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:25,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-10 00:52:25,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:25,283 INFO L225 Difference]: With dead ends: 2782 [2024-11-10 00:52:25,283 INFO L226 Difference]: Without dead ends: 2218 [2024-11-10 00:52:25,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:25,285 INFO L432 NwaCegarLoop]: 2257 mSDtfsCounter, 2170 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:25,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2024-11-10 00:52:25,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2215. [2024-11-10 00:52:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 2213 states have (on average 1.8666967916854948) internal successors, (4131), 2214 states have internal predecessors, (4131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 4131 transitions. [2024-11-10 00:52:25,340 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 4131 transitions. Word has length 52 [2024-11-10 00:52:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:25,340 INFO L471 AbstractCegarLoop]: Abstraction has 2215 states and 4131 transitions. [2024-11-10 00:52:25,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 4131 transitions. [2024-11-10 00:52:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:25,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:25,342 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:52:25,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:52:25,342 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:25,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:25,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1969902973, now seen corresponding path program 1 times [2024-11-10 00:52:25,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:25,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032300396] [2024-11-10 00:52:25,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:25,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:52:25,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:25,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032300396] [2024-11-10 00:52:25,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032300396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:25,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:25,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:25,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765739834] [2024-11-10 00:52:25,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:25,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:25,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:25,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:25,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:25,478 INFO L87 Difference]: Start difference. First operand 2215 states and 4131 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:25,689 INFO L93 Difference]: Finished difference Result 8246 states and 12469 transitions. [2024-11-10 00:52:25,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:25,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 69 [2024-11-10 00:52:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:25,716 INFO L225 Difference]: With dead ends: 8246 [2024-11-10 00:52:25,716 INFO L226 Difference]: Without dead ends: 6819 [2024-11-10 00:52:25,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:25,722 INFO L432 NwaCegarLoop]: 2271 mSDtfsCounter, 6723 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6723 SdHoareTripleChecker+Valid, 4756 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:25,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6723 Valid, 4756 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6819 states. [2024-11-10 00:52:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6819 to 3639. [2024-11-10 00:52:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 3637 states have (on average 1.6725323068463018) internal successors, (6083), 3638 states have internal predecessors, (6083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 6083 transitions. [2024-11-10 00:52:25,931 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 6083 transitions. Word has length 69 [2024-11-10 00:52:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:25,931 INFO L471 AbstractCegarLoop]: Abstraction has 3639 states and 6083 transitions. [2024-11-10 00:52:25,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 6083 transitions. [2024-11-10 00:52:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:25,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:25,934 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:52:25,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:52:25,934 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:25,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1955453117, now seen corresponding path program 1 times [2024-11-10 00:52:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:25,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844102656] [2024-11-10 00:52:25,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:25,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:52:26,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:26,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844102656] [2024-11-10 00:52:26,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844102656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:26,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:26,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:26,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159398336] [2024-11-10 00:52:26,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:26,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:26,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:26,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:26,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:26,098 INFO L87 Difference]: Start difference. First operand 3639 states and 6083 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:26,386 INFO L93 Difference]: Finished difference Result 9670 states and 14421 transitions. [2024-11-10 00:52:26,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:26,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:52:26,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:26,416 INFO L225 Difference]: With dead ends: 9670 [2024-11-10 00:52:26,416 INFO L226 Difference]: Without dead ends: 8243 [2024-11-10 00:52:26,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:26,423 INFO L432 NwaCegarLoop]: 2267 mSDtfsCounter, 6750 mSDsluCounter, 2435 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6750 SdHoareTripleChecker+Valid, 4702 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:26,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6750 Valid, 4702 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8243 states. [2024-11-10 00:52:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8243 to 5783. [2024-11-10 00:52:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5783 states, 5781 states have (on average 1.5559591766130427) internal successors, (8995), 5782 states have internal predecessors, (8995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 8995 transitions. [2024-11-10 00:52:26,651 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 8995 transitions. Word has length 69 [2024-11-10 00:52:26,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:26,652 INFO L471 AbstractCegarLoop]: Abstraction has 5783 states and 8995 transitions. [2024-11-10 00:52:26,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 8995 transitions. [2024-11-10 00:52:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:26,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:26,657 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:52:26,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:52:26,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:26,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:26,658 INFO L85 PathProgramCache]: Analyzing trace with hash -247911427, now seen corresponding path program 1 times [2024-11-10 00:52:26,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:26,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200118835] [2024-11-10 00:52:26,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:26,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:52:26,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:26,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200118835] [2024-11-10 00:52:26,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200118835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:26,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:26,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:26,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599546916] [2024-11-10 00:52:26,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:26,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:26,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:26,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:26,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:26,810 INFO L87 Difference]: Start difference. First operand 5783 states and 8995 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:27,107 INFO L93 Difference]: Finished difference Result 11094 states and 16373 transitions. [2024-11-10 00:52:27,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:27,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 69 [2024-11-10 00:52:27,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:27,134 INFO L225 Difference]: With dead ends: 11094 [2024-11-10 00:52:27,135 INFO L226 Difference]: Without dead ends: 9667 [2024-11-10 00:52:27,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:27,142 INFO L432 NwaCegarLoop]: 2270 mSDtfsCounter, 6738 mSDsluCounter, 2440 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6738 SdHoareTripleChecker+Valid, 4710 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:27,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6738 Valid, 4710 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:27,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9667 states. [2024-11-10 00:52:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9667 to 7207. [2024-11-10 00:52:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7207 states, 7205 states have (on average 1.5193615544760584) internal successors, (10947), 7206 states have internal predecessors, (10947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7207 states to 7207 states and 10947 transitions. [2024-11-10 00:52:27,432 INFO L78 Accepts]: Start accepts. Automaton has 7207 states and 10947 transitions. Word has length 69 [2024-11-10 00:52:27,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:27,432 INFO L471 AbstractCegarLoop]: Abstraction has 7207 states and 10947 transitions. [2024-11-10 00:52:27,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 7207 states and 10947 transitions. [2024-11-10 00:52:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:27,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:27,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:27,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:52:27,435 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:27,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash -929294009, now seen corresponding path program 1 times [2024-11-10 00:52:27,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:27,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420756858] [2024-11-10 00:52:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:27,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:27,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:27,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420756858] [2024-11-10 00:52:27,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420756858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:27,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:27,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:27,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549139785] [2024-11-10 00:52:27,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:27,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:52:27,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:27,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:52:27,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:52:27,579 INFO L87 Difference]: Start difference. First operand 7207 states and 10947 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:35,424 INFO L93 Difference]: Finished difference Result 9466 states and 17300 transitions. [2024-11-10 00:52:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:52:35,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-10 00:52:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:35,442 INFO L225 Difference]: With dead ends: 9466 [2024-11-10 00:52:35,443 INFO L226 Difference]: Without dead ends: 8711 [2024-11-10 00:52:35,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:52:35,448 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 4411 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4411 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 9119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:35,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4411 Valid, 810 Invalid, 9119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-10 00:52:35,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8711 states. [2024-11-10 00:52:35,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8711 to 8711. [2024-11-10 00:52:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8711 states, 8709 states have (on average 1.6402572051900333) internal successors, (14285), 8710 states have internal predecessors, (14285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:35,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8711 states to 8711 states and 14285 transitions. [2024-11-10 00:52:35,708 INFO L78 Accepts]: Start accepts. Automaton has 8711 states and 14285 transitions. Word has length 69 [2024-11-10 00:52:35,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:35,708 INFO L471 AbstractCegarLoop]: Abstraction has 8711 states and 14285 transitions. [2024-11-10 00:52:35,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:35,708 INFO L276 IsEmpty]: Start isEmpty. Operand 8711 states and 14285 transitions. [2024-11-10 00:52:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:52:35,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:35,710 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:52:35,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:52:35,711 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:35,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:35,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1285540063, now seen corresponding path program 1 times [2024-11-10 00:52:35,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:35,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248998904] [2024-11-10 00:52:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:35,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:35,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:35,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248998904] [2024-11-10 00:52:35,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248998904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:35,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:35,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:35,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55709758] [2024-11-10 00:52:35,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:35,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:35,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:35,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:35,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:35,826 INFO L87 Difference]: Start difference. First operand 8711 states and 14285 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:35,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:35,935 INFO L93 Difference]: Finished difference Result 13345 states and 20718 transitions. [2024-11-10 00:52:35,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:35,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:52:35,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:35,952 INFO L225 Difference]: With dead ends: 13345 [2024-11-10 00:52:35,952 INFO L226 Difference]: Without dead ends: 6926 [2024-11-10 00:52:35,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:35,964 INFO L432 NwaCegarLoop]: 2247 mSDtfsCounter, 43 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4445 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:35,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4445 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:35,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6926 states. [2024-11-10 00:52:36,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6926 to 6923. [2024-11-10 00:52:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6923 states, 6921 states have (on average 1.712035832972114) internal successors, (11849), 6922 states have internal predecessors, (11849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6923 states to 6923 states and 11849 transitions. [2024-11-10 00:52:36,129 INFO L78 Accepts]: Start accepts. Automaton has 6923 states and 11849 transitions. Word has length 71 [2024-11-10 00:52:36,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:36,129 INFO L471 AbstractCegarLoop]: Abstraction has 6923 states and 11849 transitions. [2024-11-10 00:52:36,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 6923 states and 11849 transitions. [2024-11-10 00:52:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:52:36,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:36,131 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:52:36,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:52:36,131 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:36,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 717327165, now seen corresponding path program 1 times [2024-11-10 00:52:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:36,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293463345] [2024-11-10 00:52:36,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:36,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:52:36,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:36,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293463345] [2024-11-10 00:52:36,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293463345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:36,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:36,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:36,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947776974] [2024-11-10 00:52:36,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:36,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:36,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:36,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:36,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:36,268 INFO L87 Difference]: Start difference. First operand 6923 states and 11849 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:36,489 INFO L93 Difference]: Finished difference Result 11034 states and 17555 transitions. [2024-11-10 00:52:36,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:36,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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 71 [2024-11-10 00:52:36,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:36,511 INFO L225 Difference]: With dead ends: 11034 [2024-11-10 00:52:36,511 INFO L226 Difference]: Without dead ends: 10007 [2024-11-10 00:52:36,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:36,517 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 6731 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6731 SdHoareTripleChecker+Valid, 4797 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:36,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6731 Valid, 4797 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:36,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10007 states. [2024-11-10 00:52:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10007 to 7947. [2024-11-10 00:52:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7947 states, 7945 states have (on average 1.6685966016362492) internal successors, (13257), 7946 states have internal predecessors, (13257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7947 states to 7947 states and 13257 transitions. [2024-11-10 00:52:36,705 INFO L78 Accepts]: Start accepts. Automaton has 7947 states and 13257 transitions. Word has length 71 [2024-11-10 00:52:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:36,705 INFO L471 AbstractCegarLoop]: Abstraction has 7947 states and 13257 transitions. [2024-11-10 00:52:36,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 13257 transitions. [2024-11-10 00:52:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:52:36,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:36,708 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:52:36,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:52:36,708 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:36,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:36,709 INFO L85 PathProgramCache]: Analyzing trace with hash 151031455, now seen corresponding path program 1 times [2024-11-10 00:52:36,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:36,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517184774] [2024-11-10 00:52:36,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:36,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:36,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:36,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517184774] [2024-11-10 00:52:36,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517184774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:36,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:36,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:36,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292366270] [2024-11-10 00:52:36,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:36,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:36,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:36,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:36,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:36,830 INFO L87 Difference]: Start difference. First operand 7947 states and 13257 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:36,981 INFO L93 Difference]: Finished difference Result 10769 states and 17133 transitions. [2024-11-10 00:52:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:36,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-11-10 00:52:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:36,994 INFO L225 Difference]: With dead ends: 10769 [2024-11-10 00:52:36,994 INFO L226 Difference]: Without dead ends: 5134 [2024-11-10 00:52:37,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:37,002 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 36 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4430 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:37,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4430 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5134 states. [2024-11-10 00:52:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5134 to 5131. [2024-11-10 00:52:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5131 states, 5129 states have (on average 1.8212127120296353) internal successors, (9341), 5130 states have internal predecessors, (9341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5131 states to 5131 states and 9341 transitions. [2024-11-10 00:52:37,146 INFO L78 Accepts]: Start accepts. Automaton has 5131 states and 9341 transitions. Word has length 73 [2024-11-10 00:52:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:37,147 INFO L471 AbstractCegarLoop]: Abstraction has 5131 states and 9341 transitions. [2024-11-10 00:52:37,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 5131 states and 9341 transitions. [2024-11-10 00:52:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 00:52:37,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:37,149 INFO L215 NwaCegarLoop]: trace histogram [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-11-10 00:52:37,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:52:37,149 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:37,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash 450631713, now seen corresponding path program 1 times [2024-11-10 00:52:37,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:37,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703479278] [2024-11-10 00:52:37,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:37,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:37,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703479278] [2024-11-10 00:52:37,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703479278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:37,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:37,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:37,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519334408] [2024-11-10 00:52:37,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:37,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:37,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:37,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:37,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:37,265 INFO L87 Difference]: Start difference. First operand 5131 states and 9341 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:37,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:37,340 INFO L93 Difference]: Finished difference Result 6545 states and 11259 transitions. [2024-11-10 00:52:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:37,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-11-10 00:52:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:37,351 INFO L225 Difference]: With dead ends: 6545 [2024-11-10 00:52:37,352 INFO L226 Difference]: Without dead ends: 3726 [2024-11-10 00:52:37,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:37,357 INFO L432 NwaCegarLoop]: 2233 mSDtfsCounter, 31 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 4415 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:37,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 4415 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2024-11-10 00:52:37,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3723. [2024-11-10 00:52:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3723 states, 3721 states have (on average 1.9900564364418167) internal successors, (7405), 3722 states have internal predecessors, (7405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 7405 transitions. [2024-11-10 00:52:37,458 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 7405 transitions. Word has length 75 [2024-11-10 00:52:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:37,458 INFO L471 AbstractCegarLoop]: Abstraction has 3723 states and 7405 transitions. [2024-11-10 00:52:37,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 7405 transitions. [2024-11-10 00:52:37,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 00:52:37,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:37,462 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:37,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:52:37,462 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:37,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:37,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1411349864, now seen corresponding path program 1 times [2024-11-10 00:52:37,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:37,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283560218] [2024-11-10 00:52:37,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:37,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:37,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:37,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283560218] [2024-11-10 00:52:37,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283560218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:37,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:37,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:37,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459843627] [2024-11-10 00:52:37,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:37,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:37,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:37,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:37,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:37,617 INFO L87 Difference]: Start difference. First operand 3723 states and 7405 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:37,702 INFO L93 Difference]: Finished difference Result 4433 states and 8355 transitions. [2024-11-10 00:52:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:37,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-10 00:52:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:37,712 INFO L225 Difference]: With dead ends: 4433 [2024-11-10 00:52:37,713 INFO L226 Difference]: Without dead ends: 3022 [2024-11-10 00:52:37,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:37,716 INFO L432 NwaCegarLoop]: 2226 mSDtfsCounter, 28 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4400 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:37,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4400 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2024-11-10 00:52:37,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3019. [2024-11-10 00:52:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 3017 states have (on average 2.1372224063639376) internal successors, (6448), 3018 states have internal predecessors, (6448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 6448 transitions. [2024-11-10 00:52:37,797 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 6448 transitions. Word has length 77 [2024-11-10 00:52:37,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:37,797 INFO L471 AbstractCegarLoop]: Abstraction has 3019 states and 6448 transitions. [2024-11-10 00:52:37,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 6448 transitions. [2024-11-10 00:52:37,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:52:37,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:37,799 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:37,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:52:37,799 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:37,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:37,801 INFO L85 PathProgramCache]: Analyzing trace with hash -575781937, now seen corresponding path program 1 times [2024-11-10 00:52:37,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:37,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199261282] [2024-11-10 00:52:37,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:37,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:38,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199261282] [2024-11-10 00:52:38,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199261282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:38,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827226979] [2024-11-10 00:52:38,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:38,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:38,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:38,357 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:52:38,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:52:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:38,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:52:38,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:39,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:40,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827226979] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:40,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:40,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-10 00:52:40,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685802923] [2024-11-10 00:52:40,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:40,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 00:52:40,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:40,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 00:52:40,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-11-10 00:52:40,088 INFO L87 Difference]: Start difference. First operand 3019 states and 6448 transitions. Second operand has 22 states, 22 states have (on average 8.409090909090908) internal successors, (185), 21 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-11-10 00:52:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:40,616 INFO L93 Difference]: Finished difference Result 4502 states and 8423 transitions. [2024-11-10 00:52:40,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:52:40,617 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.409090909090908) internal successors, (185), 21 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 79 [2024-11-10 00:52:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:40,625 INFO L225 Difference]: With dead ends: 4502 [2024-11-10 00:52:40,626 INFO L226 Difference]: Without dead ends: 3795 [2024-11-10 00:52:40,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2024-11-10 00:52:40,628 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 24191 mSDsluCounter, 4649 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24191 SdHoareTripleChecker+Valid, 6837 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:40,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24191 Valid, 6837 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:52:40,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states. [2024-11-10 00:52:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 3767. [2024-11-10 00:52:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3767 states, 3765 states have (on average 1.9697211155378487) internal successors, (7416), 3766 states have internal predecessors, (7416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 7416 transitions. [2024-11-10 00:52:40,697 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 7416 transitions. Word has length 79 [2024-11-10 00:52:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:40,697 INFO L471 AbstractCegarLoop]: Abstraction has 3767 states and 7416 transitions. [2024-11-10 00:52:40,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.409090909090908) internal successors, (185), 21 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-11-10 00:52:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 7416 transitions. [2024-11-10 00:52:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:52:40,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:40,699 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:40,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:52:40,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:40,904 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:40,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:40,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2128623729, now seen corresponding path program 1 times [2024-11-10 00:52:40,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:40,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707454246] [2024-11-10 00:52:40,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:40,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:41,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:41,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707454246] [2024-11-10 00:52:41,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707454246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:41,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416093429] [2024-11-10 00:52:41,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:41,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:41,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:41,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:52:41,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:52:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:41,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:52:41,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:41,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:42,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416093429] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:42,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:42,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-10 00:52:42,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235417125] [2024-11-10 00:52:42,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:42,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 00:52:42,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:42,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 00:52:42,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:52:42,699 INFO L87 Difference]: Start difference. First operand 3767 states and 7416 transitions. Second operand has 21 states, 21 states have (on average 8.0) internal successors, (168), 20 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:43,307 INFO L93 Difference]: Finished difference Result 6812 states and 11426 transitions. [2024-11-10 00:52:43,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:52:43,307 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.0) internal successors, (168), 20 states have internal predecessors, (168), 0 states have call successors, (0), 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 79 [2024-11-10 00:52:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:43,317 INFO L225 Difference]: With dead ends: 6812 [2024-11-10 00:52:43,317 INFO L226 Difference]: Without dead ends: 5357 [2024-11-10 00:52:43,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2024-11-10 00:52:43,321 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 24081 mSDsluCounter, 4691 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24081 SdHoareTripleChecker+Valid, 6879 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:43,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24081 Valid, 6879 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:52:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5357 states. [2024-11-10 00:52:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5357 to 5307. [2024-11-10 00:52:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5307 states, 5305 states have (on average 1.769085768143261) internal successors, (9385), 5306 states have internal predecessors, (9385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5307 states to 5307 states and 9385 transitions. [2024-11-10 00:52:43,424 INFO L78 Accepts]: Start accepts. Automaton has 5307 states and 9385 transitions. Word has length 79 [2024-11-10 00:52:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:43,424 INFO L471 AbstractCegarLoop]: Abstraction has 5307 states and 9385 transitions. [2024-11-10 00:52:43,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.0) internal successors, (168), 20 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:43,425 INFO L276 IsEmpty]: Start isEmpty. Operand 5307 states and 9385 transitions. [2024-11-10 00:52:43,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:52:43,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:43,426 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:43,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:52:43,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-10 00:52:43,628 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:43,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:43,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1300649617, now seen corresponding path program 1 times [2024-11-10 00:52:43,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:43,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940417594] [2024-11-10 00:52:43,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:43,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:44,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:44,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940417594] [2024-11-10 00:52:44,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940417594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:44,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538409724] [2024-11-10 00:52:44,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:44,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:44,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:44,708 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:52:44,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:52:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:44,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 00:52:44,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:45,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:46,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538409724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:46,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:46,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 13] total 32 [2024-11-10 00:52:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197758239] [2024-11-10 00:52:46,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:46,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 00:52:46,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:46,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 00:52:46,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2024-11-10 00:52:46,530 INFO L87 Difference]: Start difference. First operand 5307 states and 9385 transitions. Second operand has 32 states, 32 states have (on average 6.71875) internal successors, (215), 32 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:48,628 INFO L93 Difference]: Finished difference Result 17912 states and 25701 transitions. [2024-11-10 00:52:48,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-10 00:52:48,628 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.71875) internal successors, (215), 32 states have internal predecessors, (215), 0 states have call successors, (0), 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 79 [2024-11-10 00:52:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:48,645 INFO L225 Difference]: With dead ends: 17912 [2024-11-10 00:52:48,645 INFO L226 Difference]: Without dead ends: 14917 [2024-11-10 00:52:48,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=748, Invalid=3542, Unknown=0, NotChecked=0, Total=4290 [2024-11-10 00:52:48,654 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 39561 mSDsluCounter, 16202 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39561 SdHoareTripleChecker+Valid, 18429 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:48,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39561 Valid, 18429 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:52:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14917 states. [2024-11-10 00:52:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14917 to 14899. [2024-11-10 00:52:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14899 states, 14897 states have (on average 1.4525743438276162) internal successors, (21639), 14898 states have internal predecessors, (21639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14899 states to 14899 states and 21639 transitions. [2024-11-10 00:52:48,993 INFO L78 Accepts]: Start accepts. Automaton has 14899 states and 21639 transitions. Word has length 79 [2024-11-10 00:52:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:48,993 INFO L471 AbstractCegarLoop]: Abstraction has 14899 states and 21639 transitions. [2024-11-10 00:52:48,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.71875) internal successors, (215), 32 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 14899 states and 21639 transitions. [2024-11-10 00:52:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 00:52:48,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:48,996 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:49,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 00:52:49,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:49,198 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:49,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1386621459, now seen corresponding path program 1 times [2024-11-10 00:52:49,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:49,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889342655] [2024-11-10 00:52:49,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:49,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:49,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889342655] [2024-11-10 00:52:49,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889342655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:49,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772226318] [2024-11-10 00:52:49,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:49,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:49,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:49,492 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:52:49,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:52:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:49,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 00:52:49,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:51,120 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:51,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:52,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772226318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:52,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:52,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 17] total 38 [2024-11-10 00:52:52,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68581547] [2024-11-10 00:52:52,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:52,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-10 00:52:52,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:52,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-10 00:52:52,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1244, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 00:52:52,899 INFO L87 Difference]: Start difference. First operand 14899 states and 21639 transitions. Second operand has 39 states, 39 states have (on average 5.282051282051282) internal successors, (206), 38 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:56,120 INFO L93 Difference]: Finished difference Result 30137 states and 41177 transitions. [2024-11-10 00:52:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-10 00:52:56,121 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.282051282051282) internal successors, (206), 38 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 00:52:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:56,143 INFO L225 Difference]: With dead ends: 30137 [2024-11-10 00:52:56,143 INFO L226 Difference]: Without dead ends: 17550 [2024-11-10 00:52:56,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1559, Invalid=5581, Unknown=0, NotChecked=0, Total=7140 [2024-11-10 00:52:56,159 INFO L432 NwaCegarLoop]: 2229 mSDtfsCounter, 27242 mSDsluCounter, 18513 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27242 SdHoareTripleChecker+Valid, 20742 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:56,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27242 Valid, 20742 Invalid, 1615 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 00:52:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17550 states. [2024-11-10 00:52:56,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17550 to 15739. [2024-11-10 00:52:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15739 states, 15737 states have (on average 1.4351528245535998) internal successors, (22585), 15738 states have internal predecessors, (22585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15739 states to 15739 states and 22585 transitions. [2024-11-10 00:52:56,666 INFO L78 Accepts]: Start accepts. Automaton has 15739 states and 22585 transitions. Word has length 80 [2024-11-10 00:52:56,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:56,666 INFO L471 AbstractCegarLoop]: Abstraction has 15739 states and 22585 transitions. [2024-11-10 00:52:56,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.282051282051282) internal successors, (206), 38 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:56,667 INFO L276 IsEmpty]: Start isEmpty. Operand 15739 states and 22585 transitions. [2024-11-10 00:52:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:52:56,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:56,669 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:56,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 00:52:56,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:56,874 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:56,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:56,874 INFO L85 PathProgramCache]: Analyzing trace with hash 486489450, now seen corresponding path program 1 times [2024-11-10 00:52:56,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:56,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246852928] [2024-11-10 00:52:56,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:56,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246852928] [2024-11-10 00:52:59,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246852928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304449278] [2024-11-10 00:52:59,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:59,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:59,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:59,202 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:52:59,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:52:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:59,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-10 00:52:59,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:53:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:53:02,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:53:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:53:08,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304449278] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:53:08,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:53:08,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 23] total 67 [2024-11-10 00:53:08,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969605547] [2024-11-10 00:53:08,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:53:08,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-10 00:53:08,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:08,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-10 00:53:08,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=4012, Unknown=0, NotChecked=0, Total=4422 [2024-11-10 00:53:08,093 INFO L87 Difference]: Start difference. First operand 15739 states and 22585 transitions. Second operand has 67 states, 67 states have (on average 3.328358208955224) internal successors, (223), 67 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)