./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.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.3.ufo.UNBOUNDED.pals+Problem12_label03.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 eac7eb39c98aff4ef80806ab78ab5db437ac2c7b09e47bea802a0bba118466ba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:47:46,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:47:46,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:47:46,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:47:46,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:47:47,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:47:47,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:47:47,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:47:47,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:47:47,004 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:47:47,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:47:47,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:47:47,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:47:47,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:47:47,006 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:47:47,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:47:47,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:47:47,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:47:47,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:47:47,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:47:47,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:47:47,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:47:47,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:47:47,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:47:47,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:47:47,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:47:47,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:47:47,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:47:47,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:47:47,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:47:47,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:47:47,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:47:47,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:47:47,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:47:47,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:47:47,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:47:47,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:47:47,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:47:47,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:47:47,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:47:47,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:47:47,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:47:47,022 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 -> eac7eb39c98aff4ef80806ab78ab5db437ac2c7b09e47bea802a0bba118466ba [2024-11-10 00:47:47,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:47:47,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:47:47,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:47:47,295 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:47:47,295 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:47:47,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-11-10 00:47:48,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:47:49,198 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:47:49,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-11-10 00:47:49,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141296761/40bf068e835a49038eceeec55db64c06/FLAGb474b5e51 [2024-11-10 00:47:49,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141296761/40bf068e835a49038eceeec55db64c06 [2024-11-10 00:47:49,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:47:49,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:47:49,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:47:49,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:47:49,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:47:49,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:47:49" (1/1) ... [2024-11-10 00:47:49,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a11343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:49, skipping insertion in model container [2024-11-10 00:47:49,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:47:49" (1/1) ... [2024-11-10 00:47:49,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:47:49,759 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.3.ufo.UNBOUNDED.pals+Problem12_label03.c[6450,6463] [2024-11-10 00:47:49,805 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.3.ufo.UNBOUNDED.pals+Problem12_label03.c[8787,8800] [2024-11-10 00:47:50,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:47:50,469 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:47:50,504 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.3.ufo.UNBOUNDED.pals+Problem12_label03.c[6450,6463] [2024-11-10 00:47:50,514 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.3.ufo.UNBOUNDED.pals+Problem12_label03.c[8787,8800] [2024-11-10 00:47:50,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:47:50,943 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:47:50,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:50 WrapperNode [2024-11-10 00:47:50,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:47:50,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:47:50,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:47:50,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:47:50,953 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:47:50" (1/1) ... [2024-11-10 00:47:51,000 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:47:50" (1/1) ... [2024-11-10 00:47:51,302 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4981 [2024-11-10 00:47:51,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:47:51,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:47:51,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:47:51,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:47:51,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:50" (1/1) ... [2024-11-10 00:47:51,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:50" (1/1) ... [2024-11-10 00:47:51,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:50" (1/1) ... [2024-11-10 00:47:51,533 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:47:51,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:50" (1/1) ... [2024-11-10 00:47:51,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:50" (1/1) ... [2024-11-10 00:47:51,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:50" (1/1) ... [2024-11-10 00:47:51,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:50" (1/1) ... [2024-11-10 00:47:51,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:50" (1/1) ... [2024-11-10 00:47:51,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:50" (1/1) ... [2024-11-10 00:47:51,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:47:51,792 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:47:51,792 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:47:51,793 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:47:51,794 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:50" (1/1) ... [2024-11-10 00:47:51,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:47:51,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:51,826 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:47:51,828 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:47:51,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:47:51,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:47:51,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:47:51,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:47:51,977 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:47:51,980 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:47:56,929 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987: havoc calculate_output_#t~ret29#1; [2024-11-10 00:47:56,930 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3466: havoc calculate_output2_#t~ret30#1; [2024-11-10 00:47:56,930 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4956: havoc calculate_output3_#t~ret31#1; [2024-11-10 00:47:57,275 INFO L? ?]: Removed 2071 outVars from TransFormulas that were not future-live. [2024-11-10 00:47:57,275 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:47:57,317 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:47:57,317 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:47:57,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:47:57 BoogieIcfgContainer [2024-11-10 00:47:57,318 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:47:57,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:47:57,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:47:57,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:47:57,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:47:49" (1/3) ... [2024-11-10 00:47:57,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3839a48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:47:57, skipping insertion in model container [2024-11-10 00:47:57,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:50" (2/3) ... [2024-11-10 00:47:57,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3839a48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:47:57, skipping insertion in model container [2024-11-10 00:47:57,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:47:57" (3/3) ... [2024-11-10 00:47:57,329 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-11-10 00:47:57,342 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:47:57,342 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:47:57,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:47:57,444 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;@ddc425, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:47:57,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:47:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 881 states, 878 states have (on average 2.673120728929385) internal successors, (2347), 880 states have internal predecessors, (2347), 0 states have call successors, (0), 0 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:47:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:47:57,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:57,463 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] [2024-11-10 00:47:57,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:57,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:57,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1188851101, now seen corresponding path program 1 times [2024-11-10 00:47:57,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:57,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323032844] [2024-11-10 00:47:57,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:57,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:57,793 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:47:57,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:57,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323032844] [2024-11-10 00:47:57,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323032844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:57,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:57,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:47:57,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292294208] [2024-11-10 00:47:57,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:57,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:57,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:57,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:57,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:57,832 INFO L87 Difference]: Start difference. First operand has 881 states, 878 states have (on average 2.673120728929385) internal successors, (2347), 880 states have internal predecessors, (2347), 0 states have call successors, (0), 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 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:48:02,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:02,507 INFO L93 Difference]: Finished difference Result 2508 states and 6849 transitions. [2024-11-10 00:48:02,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:02,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-10 00:48:02,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:02,536 INFO L225 Difference]: With dead ends: 2508 [2024-11-10 00:48:02,536 INFO L226 Difference]: Without dead ends: 1565 [2024-11-10 00:48:02,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:02,543 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 1572 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 4393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:02,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 622 Invalid, 4393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-10 00:48:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2024-11-10 00:48:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2024-11-10 00:48:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1563 states have (on average 2.477287268074216) internal successors, (3872), 1564 states have internal predecessors, (3872), 0 states have call successors, (0), 0 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:48:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 3872 transitions. [2024-11-10 00:48:02,652 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 3872 transitions. Word has length 22 [2024-11-10 00:48:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:02,653 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 3872 transitions. [2024-11-10 00:48:02,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:48:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 3872 transitions. [2024-11-10 00:48:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:48:02,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:02,654 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] [2024-11-10 00:48:02,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:48:02,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:02,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash 6003819, now seen corresponding path program 1 times [2024-11-10 00:48:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:02,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108213826] [2024-11-10 00:48:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:02,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:02,834 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:48:02,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:02,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108213826] [2024-11-10 00:48:02,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108213826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:02,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:02,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:48:02,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514642192] [2024-11-10 00:48:02,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:02,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:48:02,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:02,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:48:02,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:48:02,840 INFO L87 Difference]: Start difference. First operand 1565 states and 3872 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:48:02,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:02,913 INFO L93 Difference]: Finished difference Result 1604 states and 3929 transitions. [2024-11-10 00:48:02,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:48:02,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-10 00:48:02,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:02,921 INFO L225 Difference]: With dead ends: 1604 [2024-11-10 00:48:02,922 INFO L226 Difference]: Without dead ends: 1565 [2024-11-10 00:48:02,924 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:48:02,925 INFO L432 NwaCegarLoop]: 2210 mSDtfsCounter, 0 mSDsluCounter, 6609 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8819 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:02,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8819 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2024-11-10 00:48:02,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2024-11-10 00:48:02,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1563 states have (on average 2.4670505438259758) internal successors, (3856), 1564 states have internal predecessors, (3856), 0 states have call successors, (0), 0 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:48:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 3856 transitions. [2024-11-10 00:48:02,966 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 3856 transitions. Word has length 22 [2024-11-10 00:48:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:02,966 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 3856 transitions. [2024-11-10 00:48:02,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:48:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 3856 transitions. [2024-11-10 00:48:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 00:48:02,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:02,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:02,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:48:02,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:02,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1519636538, now seen corresponding path program 1 times [2024-11-10 00:48:02,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:02,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499659691] [2024-11-10 00:48:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:03,139 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:48:03,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:03,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499659691] [2024-11-10 00:48:03,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499659691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:03,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:03,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:48:03,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942668397] [2024-11-10 00:48:03,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:03,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:48:03,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:03,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:48:03,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:48:03,143 INFO L87 Difference]: Start difference. First operand 1565 states and 3856 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:03,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:03,274 INFO L93 Difference]: Finished difference Result 1775 states and 4174 transitions. [2024-11-10 00:48:03,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:48:03,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-10 00:48:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:03,284 INFO L225 Difference]: With dead ends: 1775 [2024-11-10 00:48:03,284 INFO L226 Difference]: Without dead ends: 1740 [2024-11-10 00:48:03,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:48:03,286 INFO L432 NwaCegarLoop]: 2190 mSDtfsCounter, 6708 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6708 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:03,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6708 Valid, 2492 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:48:03,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2024-11-10 00:48:03,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1597. [2024-11-10 00:48:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1595 states have (on average 2.4482758620689653) internal successors, (3905), 1596 states have internal predecessors, (3905), 0 states have call successors, (0), 0 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:48:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 3905 transitions. [2024-11-10 00:48:03,324 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 3905 transitions. Word has length 37 [2024-11-10 00:48:03,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:03,325 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 3905 transitions. [2024-11-10 00:48:03,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:48:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 3905 transitions. [2024-11-10 00:48:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 00:48:03,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:03,327 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] [2024-11-10 00:48:03,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:48:03,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:03,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:03,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2087439128, now seen corresponding path program 1 times [2024-11-10 00:48:03,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:03,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386627665] [2024-11-10 00:48:03,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:03,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:03,495 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:48:03,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:03,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386627665] [2024-11-10 00:48:03,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386627665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:03,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:03,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:48:03,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052907082] [2024-11-10 00:48:03,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:03,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:48:03,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:03,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:48:03,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:48:03,498 INFO L87 Difference]: Start difference. First operand 1597 states and 3905 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:48:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:03,583 INFO L93 Difference]: Finished difference Result 1667 states and 4009 transitions. [2024-11-10 00:48:03,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:48:03,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-10 00:48:03,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:03,591 INFO L225 Difference]: With dead ends: 1667 [2024-11-10 00:48:03,591 INFO L226 Difference]: Without dead ends: 1600 [2024-11-10 00:48:03,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:48:03,595 INFO L432 NwaCegarLoop]: 2191 mSDtfsCounter, 2162 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2162 SdHoareTripleChecker+Valid, 2338 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:03,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2162 Valid, 2338 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2024-11-10 00:48:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1597. [2024-11-10 00:48:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1595 states have (on average 2.4476489028213164) internal successors, (3904), 1596 states have internal predecessors, (3904), 0 states have call successors, (0), 0 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:48:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 3904 transitions. [2024-11-10 00:48:03,635 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 3904 transitions. Word has length 39 [2024-11-10 00:48:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:03,635 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 3904 transitions. [2024-11-10 00:48:03,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:48:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 3904 transitions. [2024-11-10 00:48:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 00:48:03,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:03,637 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] [2024-11-10 00:48:03,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:48:03,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:03,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1437715677, now seen corresponding path program 1 times [2024-11-10 00:48:03,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:03,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683098809] [2024-11-10 00:48:03,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:03,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:03,706 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:48:03,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:03,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683098809] [2024-11-10 00:48:03,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683098809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:03,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:03,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084277906] [2024-11-10 00:48:03,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:03,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:03,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:03,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:03,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:03,710 INFO L87 Difference]: Start difference. First operand 1597 states and 3904 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 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:48:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:03,749 INFO L93 Difference]: Finished difference Result 1719 states and 4086 transitions. [2024-11-10 00:48:03,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:03,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-11-10 00:48:03,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:03,758 INFO L225 Difference]: With dead ends: 1719 [2024-11-10 00:48:03,758 INFO L226 Difference]: Without dead ends: 1652 [2024-11-10 00:48:03,761 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:48:03,761 INFO L432 NwaCegarLoop]: 2192 mSDtfsCounter, 2152 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 2238 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:48:03,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 2238 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:03,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2024-11-10 00:48:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1647. [2024-11-10 00:48:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1645 states have (on average 2.4170212765957446) internal successors, (3976), 1646 states have internal predecessors, (3976), 0 states have call successors, (0), 0 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:48:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 3976 transitions. [2024-11-10 00:48:03,880 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 3976 transitions. Word has length 40 [2024-11-10 00:48:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:03,882 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 3976 transitions. [2024-11-10 00:48:03,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 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:48:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 3976 transitions. [2024-11-10 00:48:03,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:48:03,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:03,886 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] [2024-11-10 00:48:03,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:48:03,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:03,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:03,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1044566890, now seen corresponding path program 1 times [2024-11-10 00:48:03,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:03,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132344668] [2024-11-10 00:48:03,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:03,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:03,933 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:48:03,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:03,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132344668] [2024-11-10 00:48:03,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132344668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:03,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:03,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:03,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506480610] [2024-11-10 00:48:03,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:03,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:03,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:03,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:03,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:03,936 INFO L87 Difference]: Start difference. First operand 1647 states and 3976 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:48:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:03,975 INFO L93 Difference]: Finished difference Result 1865 states and 4294 transitions. [2024-11-10 00:48:03,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:03,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-10 00:48:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:03,983 INFO L225 Difference]: With dead ends: 1865 [2024-11-10 00:48:03,983 INFO L226 Difference]: Without dead ends: 1748 [2024-11-10 00:48:03,984 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:48:03,985 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 2161 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 2283 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:48:03,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2161 Valid, 2283 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:03,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2024-11-10 00:48:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1745. [2024-11-10 00:48:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1743 states have (on average 2.3608720596672406) internal successors, (4115), 1744 states have internal predecessors, (4115), 0 states have call successors, (0), 0 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:48:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 4115 transitions. [2024-11-10 00:48:04,026 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 4115 transitions. Word has length 41 [2024-11-10 00:48:04,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:04,026 INFO L471 AbstractCegarLoop]: Abstraction has 1745 states and 4115 transitions. [2024-11-10 00:48:04,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:48:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 4115 transitions. [2024-11-10 00:48:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:48:04,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:04,029 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] [2024-11-10 00:48:04,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:48:04,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:04,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:04,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1158797654, now seen corresponding path program 1 times [2024-11-10 00:48:04,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:04,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008862117] [2024-11-10 00:48:04,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:04,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:04,075 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:48:04,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:04,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008862117] [2024-11-10 00:48:04,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008862117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:04,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:04,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:04,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141185821] [2024-11-10 00:48:04,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:04,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:04,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:04,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:04,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:04,078 INFO L87 Difference]: Start difference. First operand 1745 states and 4115 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:48:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:04,113 INFO L93 Difference]: Finished difference Result 2143 states and 4683 transitions. [2024-11-10 00:48:04,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:04,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-10 00:48:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:04,122 INFO L225 Difference]: With dead ends: 2143 [2024-11-10 00:48:04,122 INFO L226 Difference]: Without dead ends: 1928 [2024-11-10 00:48:04,123 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:48:04,124 INFO L432 NwaCegarLoop]: 2223 mSDtfsCounter, 2159 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2159 SdHoareTripleChecker+Valid, 2285 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:48:04,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2159 Valid, 2285 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2024-11-10 00:48:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1925. [2024-11-10 00:48:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1923 states have (on average 2.267810712428497) internal successors, (4361), 1924 states have internal predecessors, (4361), 0 states have call successors, (0), 0 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:48:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 4361 transitions. [2024-11-10 00:48:04,165 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 4361 transitions. Word has length 41 [2024-11-10 00:48:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:04,166 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 4361 transitions. [2024-11-10 00:48:04,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:48:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 4361 transitions. [2024-11-10 00:48:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:48:04,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:04,167 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] [2024-11-10 00:48:04,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:48:04,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:04,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:04,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1683074709, now seen corresponding path program 1 times [2024-11-10 00:48:04,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:04,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377667461] [2024-11-10 00:48:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:04,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:04,393 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:48:04,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:04,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377667461] [2024-11-10 00:48:04,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377667461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:04,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:04,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:48:04,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138555345] [2024-11-10 00:48:04,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:04,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:48:04,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:04,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:48:04,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:48:04,396 INFO L87 Difference]: Start difference. First operand 1925 states and 4361 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:48:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:04,489 INFO L93 Difference]: Finished difference Result 1952 states and 4395 transitions. [2024-11-10 00:48:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:48:04,490 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-10 00:48:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:04,498 INFO L225 Difference]: With dead ends: 1952 [2024-11-10 00:48:04,498 INFO L226 Difference]: Without dead ends: 1949 [2024-11-10 00:48:04,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:48:04,500 INFO L432 NwaCegarLoop]: 2190 mSDtfsCounter, 0 mSDsluCounter, 13127 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15317 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:04,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15317 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:04,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2024-11-10 00:48:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1949. [2024-11-10 00:48:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1947 states have (on average 2.2501284026707755) internal successors, (4381), 1948 states have internal predecessors, (4381), 0 states have call successors, (0), 0 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:48:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 4381 transitions. [2024-11-10 00:48:04,543 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 4381 transitions. Word has length 41 [2024-11-10 00:48:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:04,543 INFO L471 AbstractCegarLoop]: Abstraction has 1949 states and 4381 transitions. [2024-11-10 00:48:04,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:48:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 4381 transitions. [2024-11-10 00:48:04,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 00:48:04,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:04,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:04,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:48:04,545 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:04,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:04,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1278516470, now seen corresponding path program 1 times [2024-11-10 00:48:04,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:04,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882269954] [2024-11-10 00:48:04,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:04,589 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:48:04,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:04,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882269954] [2024-11-10 00:48:04,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882269954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:04,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:04,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:04,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344788484] [2024-11-10 00:48:04,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:04,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:04,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:04,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:04,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:04,591 INFO L87 Difference]: Start difference. First operand 1949 states and 4381 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 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:48:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:04,628 INFO L93 Difference]: Finished difference Result 2407 states and 5022 transitions. [2024-11-10 00:48:04,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:04,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-11-10 00:48:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:04,641 INFO L225 Difference]: With dead ends: 2407 [2024-11-10 00:48:04,641 INFO L226 Difference]: Without dead ends: 2155 [2024-11-10 00:48:04,643 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:48:04,643 INFO L432 NwaCegarLoop]: 2230 mSDtfsCounter, 2160 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 2284 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:48:04,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 2284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2024-11-10 00:48:04,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2152. [2024-11-10 00:48:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 2150 states have (on average 2.163720930232558) internal successors, (4652), 2151 states have internal predecessors, (4652), 0 states have call successors, (0), 0 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:48:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 4652 transitions. [2024-11-10 00:48:04,688 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 4652 transitions. Word has length 43 [2024-11-10 00:48:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:04,688 INFO L471 AbstractCegarLoop]: Abstraction has 2152 states and 4652 transitions. [2024-11-10 00:48:04,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 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:48:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 4652 transitions. [2024-11-10 00:48:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:48:04,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:04,690 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] [2024-11-10 00:48:04,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:48:04,690 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:04,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2051803116, now seen corresponding path program 1 times [2024-11-10 00:48:04,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:04,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549626671] [2024-11-10 00:48:04,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:04,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:48:04,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:04,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549626671] [2024-11-10 00:48:04,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549626671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:04,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:04,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:48:04,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926724376] [2024-11-10 00:48:04,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:04,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:48:04,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:04,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:48:04,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:48:04,786 INFO L87 Difference]: Start difference. First operand 2152 states and 4652 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:48:04,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:04,896 INFO L93 Difference]: Finished difference Result 4156 states and 7380 transitions. [2024-11-10 00:48:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:48:04,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:48:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:04,910 INFO L225 Difference]: With dead ends: 4156 [2024-11-10 00:48:04,911 INFO L226 Difference]: Without dead ends: 3537 [2024-11-10 00:48:04,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:48:04,913 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 4428 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4428 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:04,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4428 Valid, 4538 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2024-11-10 00:48:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 2768. [2024-11-10 00:48:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2768 states, 2766 states have (on average 1.982646420824295) internal successors, (5484), 2767 states have internal predecessors, (5484), 0 states have call successors, (0), 0 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:48:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 5484 transitions. [2024-11-10 00:48:04,981 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 5484 transitions. Word has length 58 [2024-11-10 00:48:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:04,982 INFO L471 AbstractCegarLoop]: Abstraction has 2768 states and 5484 transitions. [2024-11-10 00:48:04,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:48:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 5484 transitions. [2024-11-10 00:48:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:48:04,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:04,984 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] [2024-11-10 00:48:04,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:48:04,984 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:04,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:04,985 INFO L85 PathProgramCache]: Analyzing trace with hash -151561428, now seen corresponding path program 1 times [2024-11-10 00:48:04,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:04,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675547927] [2024-11-10 00:48:04,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:48:05,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:05,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675547927] [2024-11-10 00:48:05,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675547927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:05,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:05,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:48:05,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232798715] [2024-11-10 00:48:05,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:05,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:48:05,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:05,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:48:05,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:48:05,136 INFO L87 Difference]: Start difference. First operand 2768 states and 5484 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:48:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:05,251 INFO L93 Difference]: Finished difference Result 4772 states and 8212 transitions. [2024-11-10 00:48:05,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:48:05,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 58 [2024-11-10 00:48:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:05,271 INFO L225 Difference]: With dead ends: 4772 [2024-11-10 00:48:05,271 INFO L226 Difference]: Without dead ends: 4153 [2024-11-10 00:48:05,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:48:05,274 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 4428 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4428 SdHoareTripleChecker+Valid, 4536 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:05,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4428 Valid, 4536 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4153 states. [2024-11-10 00:48:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4153 to 3696. [2024-11-10 00:48:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 3694 states have (on average 1.820249052517596) internal successors, (6724), 3695 states have internal predecessors, (6724), 0 states have call successors, (0), 0 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:48:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 6724 transitions. [2024-11-10 00:48:05,360 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 6724 transitions. Word has length 58 [2024-11-10 00:48:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:05,360 INFO L471 AbstractCegarLoop]: Abstraction has 3696 states and 6724 transitions. [2024-11-10 00:48:05,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:48:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 6724 transitions. [2024-11-10 00:48:05,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:48:05,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:05,362 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] [2024-11-10 00:48:05,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:48:05,363 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:05,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:05,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1612801138, now seen corresponding path program 1 times [2024-11-10 00:48:05,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:05,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635212158] [2024-11-10 00:48:05,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:05,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:05,451 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:48:05,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:05,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635212158] [2024-11-10 00:48:05,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635212158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:05,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:05,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:05,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185621938] [2024-11-10 00:48:05,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:05,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:05,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:05,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:05,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:05,454 INFO L87 Difference]: Start difference. First operand 3696 states and 6724 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:48:05,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:05,503 INFO L93 Difference]: Finished difference Result 5288 states and 8903 transitions. [2024-11-10 00:48:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:05,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:48:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:05,512 INFO L225 Difference]: With dead ends: 5288 [2024-11-10 00:48:05,512 INFO L226 Difference]: Without dead ends: 3125 [2024-11-10 00:48:05,515 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:48:05,516 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 35 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 4403 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:48:05,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 4403 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2024-11-10 00:48:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3122. [2024-11-10 00:48:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 3120 states have (on average 1.9083333333333334) internal successors, (5954), 3121 states have internal predecessors, (5954), 0 states have call successors, (0), 0 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:48:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 5954 transitions. [2024-11-10 00:48:05,590 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 5954 transitions. Word has length 60 [2024-11-10 00:48:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:05,590 INFO L471 AbstractCegarLoop]: Abstraction has 3122 states and 5954 transitions. [2024-11-10 00:48:05,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:48:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 5954 transitions. [2024-11-10 00:48:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:48:05,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:05,591 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] [2024-11-10 00:48:05,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:48:05,591 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:05,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:05,592 INFO L85 PathProgramCache]: Analyzing trace with hash 307855116, now seen corresponding path program 1 times [2024-11-10 00:48:05,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:05,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150346670] [2024-11-10 00:48:05,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:05,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:48:05,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:05,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150346670] [2024-11-10 00:48:05,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150346670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:05,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:05,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:48:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240245482] [2024-11-10 00:48:05,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:05,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:48:05,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:48:05,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:48:05,702 INFO L87 Difference]: Start difference. First operand 3122 states and 5954 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:48:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:05,821 INFO L93 Difference]: Finished difference Result 4478 states and 7810 transitions. [2024-11-10 00:48:05,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:48:05,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 60 [2024-11-10 00:48:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:05,831 INFO L225 Difference]: With dead ends: 4478 [2024-11-10 00:48:05,832 INFO L226 Difference]: Without dead ends: 4027 [2024-11-10 00:48:05,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:48:05,835 INFO L432 NwaCegarLoop]: 2236 mSDtfsCounter, 4425 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4425 SdHoareTripleChecker+Valid, 4564 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:05,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4425 Valid, 4564 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4027 states. [2024-11-10 00:48:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4027 to 3570. [2024-11-10 00:48:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3570 states, 3568 states have (on average 1.8391255605381165) internal successors, (6562), 3569 states have internal predecessors, (6562), 0 states have call successors, (0), 0 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:48:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 6562 transitions. [2024-11-10 00:48:05,930 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 6562 transitions. Word has length 60 [2024-11-10 00:48:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:05,930 INFO L471 AbstractCegarLoop]: Abstraction has 3570 states and 6562 transitions. [2024-11-10 00:48:05,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:48:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 6562 transitions. [2024-11-10 00:48:05,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:48:05,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:05,932 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] [2024-11-10 00:48:05,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:48:05,932 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:05,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:05,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1785383598, now seen corresponding path program 1 times [2024-11-10 00:48:05,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:05,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809674049] [2024-11-10 00:48:05,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:05,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:06,010 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:48:06,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:06,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809674049] [2024-11-10 00:48:06,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809674049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:06,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:06,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:06,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54965535] [2024-11-10 00:48:06,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:06,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:06,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:06,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:06,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:06,012 INFO L87 Difference]: Start difference. First operand 3570 states and 6562 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:48:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:06,053 INFO L93 Difference]: Finished difference Result 4584 states and 7934 transitions. [2024-11-10 00:48:06,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:06,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-10 00:48:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:06,060 INFO L225 Difference]: With dead ends: 4584 [2024-11-10 00:48:06,060 INFO L226 Difference]: Without dead ends: 2565 [2024-11-10 00:48:06,063 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:48:06,063 INFO L432 NwaCegarLoop]: 2215 mSDtfsCounter, 28 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4388 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:48:06,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4388 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:06,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2024-11-10 00:48:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 2562. [2024-11-10 00:48:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 2560 states have (on average 2.021875) internal successors, (5176), 2561 states have internal predecessors, (5176), 0 states have call successors, (0), 0 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:48:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 5176 transitions. [2024-11-10 00:48:06,173 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 5176 transitions. Word has length 62 [2024-11-10 00:48:06,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:06,173 INFO L471 AbstractCegarLoop]: Abstraction has 2562 states and 5176 transitions. [2024-11-10 00:48:06,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:48:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 5176 transitions. [2024-11-10 00:48:06,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 00:48:06,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:06,177 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] [2024-11-10 00:48:06,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:48:06,178 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:06,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:06,178 INFO L85 PathProgramCache]: Analyzing trace with hash -909439056, now seen corresponding path program 1 times [2024-11-10 00:48:06,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:06,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084239852] [2024-11-10 00:48:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:06,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:06,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:06,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084239852] [2024-11-10 00:48:06,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084239852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:48:06,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:48:06,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:48:06,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598364661] [2024-11-10 00:48:06,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:48:06,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:48:06,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:06,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:48:06,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:48:06,283 INFO L87 Difference]: Start difference. First operand 2562 states and 5176 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:48:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:06,327 INFO L93 Difference]: Finished difference Result 3072 states and 5855 transitions. [2024-11-10 00:48:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:48:06,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-11-10 00:48:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:06,333 INFO L225 Difference]: With dead ends: 3072 [2024-11-10 00:48:06,333 INFO L226 Difference]: Without dead ends: 2061 [2024-11-10 00:48:06,336 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:48:06,337 INFO L432 NwaCegarLoop]: 2208 mSDtfsCounter, 23 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4373 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:48:06,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4373 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:48:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2024-11-10 00:48:06,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 2058. [2024-11-10 00:48:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 2056 states have (on average 2.184824902723735) internal successors, (4492), 2057 states have internal predecessors, (4492), 0 states have call successors, (0), 0 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:48:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 4492 transitions. [2024-11-10 00:48:06,392 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 4492 transitions. Word has length 64 [2024-11-10 00:48:06,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:06,392 INFO L471 AbstractCegarLoop]: Abstraction has 2058 states and 4492 transitions. [2024-11-10 00:48:06,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:48:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 4492 transitions. [2024-11-10 00:48:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 00:48:06,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:06,394 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:06,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:48:06,395 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:06,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:06,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1765907433, now seen corresponding path program 1 times [2024-11-10 00:48:06,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:06,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326519618] [2024-11-10 00:48:06,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:06,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:06,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:06,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326519618] [2024-11-10 00:48:06,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326519618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:06,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91705203] [2024-11-10 00:48:06,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:06,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:06,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:06,829 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:48:06,830 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:48:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:06,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:48:06,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:07,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:08,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91705203] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:08,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:08,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-10 00:48:08,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276844884] [2024-11-10 00:48:08,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:08,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 00:48:08,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:08,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 00:48:08,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2024-11-10 00:48:08,283 INFO L87 Difference]: Start difference. First operand 2058 states and 4492 transitions. Second operand has 22 states, 22 states have (on average 6.681818181818182) internal successors, (147), 21 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:48:08,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:08,803 INFO L93 Difference]: Finished difference Result 3129 states and 5911 transitions. [2024-11-10 00:48:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:48:08,803 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.681818181818182) internal successors, (147), 21 states have internal predecessors, (147), 0 states have call successors, (0), 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 66 [2024-11-10 00:48:08,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:08,808 INFO L225 Difference]: With dead ends: 3129 [2024-11-10 00:48:08,808 INFO L226 Difference]: Without dead ends: 2622 [2024-11-10 00:48:08,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2024-11-10 00:48:08,810 INFO L432 NwaCegarLoop]: 2177 mSDtfsCounter, 26306 mSDsluCounter, 6729 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26306 SdHoareTripleChecker+Valid, 8906 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:08,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26306 Valid, 8906 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:48:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2024-11-10 00:48:08,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 2598. [2024-11-10 00:48:08,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 2596 states have (on average 1.9973035439137135) internal successors, (5185), 2597 states have internal predecessors, (5185), 0 states have call successors, (0), 0 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:48:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 5185 transitions. [2024-11-10 00:48:08,870 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 5185 transitions. Word has length 66 [2024-11-10 00:48:08,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:08,871 INFO L471 AbstractCegarLoop]: Abstraction has 2598 states and 5185 transitions. [2024-11-10 00:48:08,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.681818181818182) internal successors, (147), 21 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:48:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 5185 transitions. [2024-11-10 00:48:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 00:48:08,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:08,872 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:08,891 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:48:09,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 00:48:09,074 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:09,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:09,074 INFO L85 PathProgramCache]: Analyzing trace with hash 248454647, now seen corresponding path program 1 times [2024-11-10 00:48:09,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:09,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921339221] [2024-11-10 00:48:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:09,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:09,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921339221] [2024-11-10 00:48:09,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921339221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:09,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010179324] [2024-11-10 00:48:09,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:09,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:09,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:09,492 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:48:09,493 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:48:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:09,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 00:48:09,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:10,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:11,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010179324] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:11,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:11,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 28 [2024-11-10 00:48:11,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902630528] [2024-11-10 00:48:11,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:11,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 00:48:11,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:11,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 00:48:11,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2024-11-10 00:48:11,076 INFO L87 Difference]: Start difference. First operand 2598 states and 5185 transitions. Second operand has 28 states, 28 states have (on average 5.857142857142857) internal successors, (164), 28 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:48:11,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:11,850 INFO L93 Difference]: Finished difference Result 4803 states and 8071 transitions. [2024-11-10 00:48:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 00:48:11,851 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.857142857142857) internal successors, (164), 28 states have internal predecessors, (164), 0 states have call successors, (0), 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 66 [2024-11-10 00:48:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:11,857 INFO L225 Difference]: With dead ends: 4803 [2024-11-10 00:48:11,857 INFO L226 Difference]: Without dead ends: 3756 [2024-11-10 00:48:11,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=359, Invalid=1201, Unknown=0, NotChecked=0, Total=1560 [2024-11-10 00:48:11,859 INFO L432 NwaCegarLoop]: 2177 mSDtfsCounter, 15192 mSDsluCounter, 9073 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15192 SdHoareTripleChecker+Valid, 11250 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:11,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15192 Valid, 11250 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:48:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3756 states. [2024-11-10 00:48:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3756 to 3714. [2024-11-10 00:48:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 3712 states have (on average 1.777478448275862) internal successors, (6598), 3713 states have internal predecessors, (6598), 0 states have call successors, (0), 0 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:48:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 6598 transitions. [2024-11-10 00:48:11,946 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 6598 transitions. Word has length 66 [2024-11-10 00:48:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:11,946 INFO L471 AbstractCegarLoop]: Abstraction has 3714 states and 6598 transitions. [2024-11-10 00:48:11,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.857142857142857) internal successors, (164), 28 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:48:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 6598 transitions. [2024-11-10 00:48:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 00:48:11,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:11,948 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:11,965 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:48:12,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 00:48:12,149 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:12,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:12,150 INFO L85 PathProgramCache]: Analyzing trace with hash -450564137, now seen corresponding path program 1 times [2024-11-10 00:48:12,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:12,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267028960] [2024-11-10 00:48:12,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:12,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:12,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:12,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267028960] [2024-11-10 00:48:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267028960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:12,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635620985] [2024-11-10 00:48:12,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:12,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:12,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:12,554 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:48:12,555 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:48:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:12,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 00:48:12,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:13,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:14,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635620985] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:14,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:14,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2024-11-10 00:48:14,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257712584] [2024-11-10 00:48:14,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:14,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 00:48:14,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:14,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 00:48:14,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2024-11-10 00:48:14,164 INFO L87 Difference]: Start difference. First operand 3714 states and 6598 transitions. Second operand has 30 states, 30 states have (on average 5.6) internal successors, (168), 30 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:48:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:16,784 INFO L93 Difference]: Finished difference Result 8489 states and 12694 transitions. [2024-11-10 00:48:16,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-10 00:48:16,785 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.6) internal successors, (168), 30 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 66 [2024-11-10 00:48:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:16,797 INFO L225 Difference]: With dead ends: 8489 [2024-11-10 00:48:16,797 INFO L226 Difference]: Without dead ends: 6326 [2024-11-10 00:48:16,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=878, Invalid=3678, Unknown=0, NotChecked=0, Total=4556 [2024-11-10 00:48:16,804 INFO L432 NwaCegarLoop]: 2186 mSDtfsCounter, 22831 mSDsluCounter, 17969 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22831 SdHoareTripleChecker+Valid, 20155 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:16,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22831 Valid, 20155 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:48:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2024-11-10 00:48:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 5434. [2024-11-10 00:48:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5434 states, 5432 states have (on average 1.6137702503681886) internal successors, (8766), 5433 states have internal predecessors, (8766), 0 states have call successors, (0), 0 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:48:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5434 states to 5434 states and 8766 transitions. [2024-11-10 00:48:17,034 INFO L78 Accepts]: Start accepts. Automaton has 5434 states and 8766 transitions. Word has length 66 [2024-11-10 00:48:17,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:17,034 INFO L471 AbstractCegarLoop]: Abstraction has 5434 states and 8766 transitions. [2024-11-10 00:48:17,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.6) internal successors, (168), 30 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:48:17,035 INFO L276 IsEmpty]: Start isEmpty. Operand 5434 states and 8766 transitions. [2024-11-10 00:48:17,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:48:17,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:17,036 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:48:17,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 00:48:17,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 00:48:17,238 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:17,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:17,238 INFO L85 PathProgramCache]: Analyzing trace with hash -436943354, now seen corresponding path program 1 times [2024-11-10 00:48:17,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:17,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529486365] [2024-11-10 00:48:17,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:18,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:18,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529486365] [2024-11-10 00:48:18,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529486365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:18,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52242929] [2024-11-10 00:48:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:18,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:18,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:18,178 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:48:18,180 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:48:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:18,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-10 00:48:18,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:21,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:23,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52242929] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:23,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:23,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 25, 22] total 52 [2024-11-10 00:48:23,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134975829] [2024-11-10 00:48:23,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:23,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-10 00:48:23,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:23,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-10 00:48:23,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=2271, Unknown=0, NotChecked=0, Total=2652 [2024-11-10 00:48:23,376 INFO L87 Difference]: Start difference. First operand 5434 states and 8766 transitions. Second operand has 52 states, 52 states have (on average 3.4038461538461537) internal successors, (177), 52 states have internal predecessors, (177), 0 states have call successors, (0), 0 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:48:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:46,943 INFO L93 Difference]: Finished difference Result 16849 states and 23471 transitions. [2024-11-10 00:48:46,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2024-11-10 00:48:46,944 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.4038461538461537) internal successors, (177), 52 states have internal predecessors, (177), 0 states have call successors, (0), 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 67 [2024-11-10 00:48:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:46,971 INFO L225 Difference]: With dead ends: 16849 [2024-11-10 00:48:46,972 INFO L226 Difference]: Without dead ends: 14894 [2024-11-10 00:48:46,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21563 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=8835, Invalid=42015, Unknown=0, NotChecked=0, Total=50850 [2024-11-10 00:48:46,988 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 31651 mSDsluCounter, 21618 mSDsCounter, 0 mSdLazyCounter, 2764 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31651 SdHoareTripleChecker+Valid, 23823 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:46,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31651 Valid, 23823 Invalid, 2877 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [113 Valid, 2764 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 00:48:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14894 states. [2024-11-10 00:48:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14894 to 7150. [2024-11-10 00:48:47,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7150 states, 7148 states have (on average 1.5391717963066591) internal successors, (11002), 7149 states have internal predecessors, (11002), 0 states have call successors, (0), 0 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:48:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7150 states to 7150 states and 11002 transitions. [2024-11-10 00:48:47,281 INFO L78 Accepts]: Start accepts. Automaton has 7150 states and 11002 transitions. Word has length 67 [2024-11-10 00:48:47,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:47,281 INFO L471 AbstractCegarLoop]: Abstraction has 7150 states and 11002 transitions. [2024-11-10 00:48:47,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.4038461538461537) internal successors, (177), 52 states have internal predecessors, (177), 0 states have call successors, (0), 0 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:48:47,282 INFO L276 IsEmpty]: Start isEmpty. Operand 7150 states and 11002 transitions. [2024-11-10 00:48:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 00:48:47,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:47,282 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] [2024-11-10 00:48:47,302 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:48:47,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:47,484 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:47,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2015478295, now seen corresponding path program 1 times [2024-11-10 00:48:47,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:47,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370841261] [2024-11-10 00:48:47,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:47,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:48,938 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:48:48,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370841261] [2024-11-10 00:48:48,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370841261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852480259] [2024-11-10 00:48:48,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:48,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:48,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:48,941 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:48:48,941 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:48:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:49,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 00:48:49,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:51,325 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:48:51,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:54,153 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:48:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852480259] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:54,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:54,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 18] total 58 [2024-11-10 00:48:54,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761834573] [2024-11-10 00:48:54,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:54,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-10 00:48:54,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:54,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-10 00:48:54,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=2895, Unknown=0, NotChecked=0, Total=3306 [2024-11-10 00:48:54,155 INFO L87 Difference]: Start difference. First operand 7150 states and 11002 transitions. Second operand has 58 states, 58 states have (on average 3.1379310344827585) internal successors, (182), 58 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)